A Practical Guide to the Dual Theorem

Abstract

A summary of the important variations on the simplex method is presented, with an emphasis placed on the connection between these techniques, the revised simplex method, and the dual theorem. Only elementary matrix algebra is employed to enable the nonmathematician to utilize the various algorithms. Specifically, the dual simplex algorithm, parametric programming, and techniques for additional and secondary constraints, and for upper bounded variables are discussed.