A TWO-PHASE METHOD FOR THE SIMPLEX TABLEAU
暂无分享,去创建一个
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 the method determines feasibility, provided it exists, the second phase, which follows, searches for optimality.
[1] A. Charnes,et al. An Introduction to Linear Programming. , 1953 .
[2] G. Dantzig,et al. Notes on Linear Programming: Part 1. The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints , 1954 .
[3] G. Dantzig,et al. Notes on Linear Programming--Part V: A Product-Form Tableau for Revised Simplex Method: Computing Appendix for RM-1268 , 1954 .