Notes on Linear Programming: Part XI Composite Simplex — Dual Simplex Algorithm — I

Notes on Linear Programming: Part XI Composite Simplex — Dual Simplex Algorithm — I

$20.00 $20.00 Sale

A proposal for avoiding certain undesirable features of Phase I of the simplex method (i.e., by the introduction of vectors on the basis that they are likely to be in the optimal solution of Phase II).