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 ...

Ron Shamir, Probabilistic Analysis in Linear Programming, Statistical Science, Vol. 8, No. 1, Report from the Committee on Applied and Theoretical Statistics of the National Research Council on ...

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.

Linear programming -- which is not related to computer programming -- and the Simplex Algorithm provide a means for solving complicated problems with many variables and are generally employed to ...