Abstract
Our point of departure in this chapter involves the assumption that we have already obtained an optimal basic feasible solution to a linear programming problem in standard form, i.e., to a problem of the form
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Panik, M.J. (1996). Postoptimality Analysis I. In: Panik, M.J. (eds) Linear Programming: Mathematics, Theory and Algorithms. Applied Optimization, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3434-7_11
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3434-7_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3436-1
Online ISBN: 978-1-4613-3434-7
eBook Packages: Springer Book Archive