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.

In this paper, a modification of the bisection simplex method is made for more general purpose use. Organized in an alternative simpler form, the modified version exploits information of the optimal ...

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

About the same time, he invented the “simplex method,” an algorithm for solving linear programming problems.

This course examines formulation and solution of applicable optimization models, including linear, integer, nonlinear, and network problems, efficient algorithm methods, and use of computer modeling ...