Abstract
The tableau-based simplex method in Chapter 4 masks a relationship between the data in the initial tableau and in the tableaus that result from sequences of pivots. That relationship is now brought into view. Each tableau encountered by the simplex method will be shown to have at least one set of “multipliers,” one per constraint.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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 subscriptionsNotes
- 1.
Dantzig, George B. and William Orchard-Hayes, “Notes on linear programming: Part V – alternative algorithm for the revised simplex method using product form for the inverse,” RM 1268, The RAND Corporation, Santa Monica, CA, November 19, 1953.
- 2.
Denardo, E. V., E. A. Feinberg and U. G. Rothblum, “The multi-armed bandit, with constraints,” submitted for publication.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Denardo, E.V. (2011). Multipliers and the Simplex Method. In: Linear Programming and Generalizations. International Series in Operations Research & Management Science, vol 149. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6491-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6491-5_11
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6490-8
Online ISBN: 978-1-4419-6491-5
eBook Packages: Business and EconomicsBusiness and Management (R0)