Given a matrix Av and a column vector b,v one and only one of the following two alternatives holds. Either: (1) there exists a column vector xv ⩾ 0 with Axv = b,v or (2) there exists an unrestricted row vector yv for which yAv ⩾ 0 and ybv < 0. This lemma can be proved by defining appropriate primal and dual linear-programming problems and applying the duality theorem. Gordan's theorem; Strong duality theorem; Theorem of the alternatives.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Farkas' Lemma . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_330
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_330
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive