Abstract
One of the most important results in linear programming is arguably the duality theorem. Semidefinite programming also has a duality theorem, but its formulation and proof are less straightforward than in the case of linear programming.
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
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gärtner, B., Matoušek, J. (2012). Duality and Cone Programming. In: Approximation Algorithms and Semidefinite Programming. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22015-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-22015-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22014-2
Online ISBN: 978-3-642-22015-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)