Abstract
The simplex algorithm discussed in Chapter 2 solves canonical maximization and canonical minimization linear programming problems. The important properties that characterize a canonical linear programming problem (in this book at least) are the nonnegativity of the initial independent variables and the inequality form of the main constraints. However, easy modifications of the algorithms of Chapter 2 enable the solution of certain noncanonical linear programming problems. The concern of this chapter is the formalization of these modifications. Our linear programming solution procedure will consequently apply to a broader class of problems. In addition, the solution of the noncanonical problems here will be crucial to our first application in Chapter 5.
Sign-in/Register to access full text options 
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.
