The Linear Programming Problem is by far the most widely used optimization model. Its impact on economic and government modeling is immense. The Simplex Method for solving the Linear Programming (LP) ...

A computational procedure is given for finding the minimum of a quadratic function of variables subject to linear inequality constraints. The procedure is analogous to the Simplex Method for linear ...

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.