Linear programming (lp) problems with linear objective and linear constraints

Prototypical convex program; solved by simplex and interior-point methods.

Reference(s)

A new polynomial-time algorithm for linear programming
Linear Programming and Extensions

Further link(s)

Item	Property
continuous optimization problems including unconstrained/constrained smooth and non-smooth cases	specialized by
convex optimization problem class	specialized by

This page was built for task: linear programming (lp) problems with linear objective and linear constraints