Abstract
Some algorithms which we shall introduce are called primal-dual algorithms. This concept cannot be fully understood without the notion of linear programming duality. The reader not interested in the more advanced algorithms of this book can feel free to skip this chapter. The mathematics of this chapter is inevitable though, to fully appreciate the algorithms for mincost-flow and weighted matching.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hochstättler, W., Schliep, A. (2010). Linear Programming Duality. In: CATBox. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03822-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-03822-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-14887-6
Online ISBN: 978-3-642-03822-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)