Abstract
In this chapter, we will develop the concept of duality, as well as the related theorem of complementary slackness which not only tells us when we have optimal solutions, but also leads us to the Dual Simplex Method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Hu, T.C., Kahng, A.B. (2016). Duality and Complementary Slackness. In: Linear and Integer Programming Made Easy. Springer, Cham. https://doi.org/10.1007/978-3-319-24001-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-24001-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23999-6
Online ISBN: 978-3-319-24001-5
eBook Packages: EngineeringEngineering (R0)