ABSTRACT
The term linear programming (LP) refers to the problem of optimizing a linear function of several variables over linear equality or inequality constraints. In this chapter we present the problem and discuss weak and strong duality and the simplex method. For a much more detailed treatment of linear programming, consult [164].
