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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer Science+Business Media New York
About this chapter
Cite this chapter
Strayer, J.K. (1989). Noncanonical Linear Programming Problems. In: Linear Programming and Its Applications. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1009-2_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1009-2_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6982-3
Online ISBN: 978-1-4612-1009-2
eBook Packages: Springer Book Archive