Abstract
In this chapter we shall first consider two important computational variants of the standard simplex method, namely the dual simplex and primal-dual routines. These techniques are essentially modifications of the simplex method because their implementation involves a sequence of pivot operations applied to the primal problem, but based upon alternative pivot selection or entry and exit criteria. These methods were developed to: (1) reduce the number of iterations needed to achieve optimality when the number of variables (n) is large; and (2) exploit situations involving the availability of an initial basic feasible solution to the dual problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
