A version of a two-phase simplex technique is given for manually solving those linear-programming problems in which artificial vectors are introduced and subsequently driven out. The first phase of ...

Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear Programming: regression, classification and other engineering applications. Integer Linear Programming: Basics, ...

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.