Abstract
Perhaps the reader can guess the upcoming relationship between dual LP problems and dual condensed tableaux. In any case we shall define dual LP problems independently and make contact with dual tableaux afterward. The ultimate point (roughly stated) is that solving an LP problem actually solves two LP problems. The principal ideas and results of this chapter (and the next one as well) have origins in the work of John von Neumann (1903–1957).
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 LP Problems. 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_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4540-7_5
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