Abstract
Linear duality deals with the relationship between two complementary orthogonal subspaces L and L⊥ of Kn. The main theorem of linear duality, FARKAS’ Lemma, will be presented in Chapter 4. In this chapter we will derive FARKAS’ Lemma only for a special class of complementary pairs (L, L⊥) arising from directed graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bachem, A., Kern, W. (1992). Linear Duality in Graphs. In: Linear Programming Duality. Universitext. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58152-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-58152-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55417-2
Online ISBN: 978-3-642-58152-6
eBook Packages: Springer Book Archive