Notes on Linear Programming: Part VII The Dual Simplex Algorithm

Notes on Linear Programming: Part VII The Dual Simplex Algorithm

Regular price $20.00 $20.00 Sale

A procedure for solving the dual problem by means of variables associated with a basis that may have negative as well as positive values in the iterative process before an optimum is reached.