Abstract
The main theoretical tool for this chapter and the next is the consideration of a “mate” for every condensed tableau. All condensed tableaux are thereby paired off, and the members of each pair are called dual tableaux. The fundamental property of dual tableaux, roughly stated, is that the results of pivoting both can be obtained by pivoting only one of them.
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-Verlag New York Inc.
About this chapter
Cite this chapter
Brickman, L. (1989). Dual Tableaux and Two-Phase Algorithms. In: Mathematical Introduction to Linear Programming and Game Theory. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4540-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4540-7_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8869-5
Online ISBN: 978-1-4612-4540-7
eBook Packages: Springer Book Archive