The book presents a graduate level, rigorous, and self-contained introduction to linear optimization (LO), the presented topics beingexpressive abilities of LO; geometry of LO - structure of polyhedral sets, LO duality and its applications; traditional LO algorithms - primal and dual simplex methods, and network simplex method; polynomial time solvability of LO via ellipsoid algorithm; conic programming with emphasis on expressing abilities of second order and semidefinite optimization, and polynomial time primal-dual interior point algorithms for linear and semidefinite optimization.
The book presents a graduate level, rigorous, and self-contained introduction to linear optimization (LO), the presented topics beingexpressive abilities of LO; geometry of LO - structure of polyhedral sets, LO duality and its applications; traditional LO algorithms - primal and dual simplex methods, and network simplex method; polynomial time solvability of LO via ellipsoid algorithm; conic programming with emphasis on expressing abilities of second order and semidefinite optimization, and polynomial time primal-dual interior point algorithms for linear and semidefinite optimization.
Preface About the Author Main Notational Conventions Introduction to LO: Examples of LO Models Geometry of Linear Optimization: Polyhedral Sets and their Geometry Theory of Systems of Linear Inequalities and Duality Classical Algorithms of Linear Optimization: The Simplex Method: Simplex Method The Network Simplex Algorithm Complexity of Linear Optimization and the Ellipsoid Method: Polynomial Time Solvability of Linear Optimization Conic Programming and Interior Point Methods: Conic Programming Interior Point Methods for LO and Semidefinite Optimization Appendices: Prerequisites from Linear Algebra Prerequisites from Real Analysis Symmetric Matrices Bibliography Solutions to Selected Exercises Index
Preface About the Author Main Notational Conventions Introduction to LO: Examples of LO Models Geometry of Linear Optimization: Polyhedral Sets and their Geometry Theory of Systems of Linear Inequalities and Duality Classical Algorithms of Linear Optimization: The Simplex Method: Simplex Method The Network Simplex Algorithm Complexity of Linear Optimization and the Ellipsoid Method: Polynomial Time Solvability of Linear Optimization Conic Programming and Interior Point Methods: Conic Programming Interior Point Methods for LO and Semidefinite Optimization Appendices: Prerequisites from Linear Algebra Prerequisites from Real Analysis Symmetric Matrices Bibliography Solutions to Selected Exercises Index
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309