Description
Book Synopsis
Presenting a strong and clear relationship between theory and practice, Linear and Integer Optimization: Theory and Practice is divided into two main parts. The first covers the theory of linear and integer optimization, including both basic and advanced topics. Dantzig's simplex algorithm, duality, sensitivity analysis, integer optimization models, and network models are introduced.
More advanced topics also are presented including interior point algorithms, the branch-and-bound algorithm, cutting planes, complexity, standard combinatorial optimization models, the assignment problem, minimum cost flow, and the maximum flow/minimum cut theorem.
The second part applies theory through real-world case studies. The authors discuss advanced techniques such as column generation, multiobjective optimization, dynamic optimization, machine learning (support vector machines), combinatorial optimization, approximation algorithms, and game theory.
Trade Review
Praise for the first edition:
"...very recommendable as a textbook and to anybody wishing to learn the topic."
—Optimization (1997)
"...the book is a nice balance between theory and applications...and gives a sound background for the techniques used and for investigating real problems."
—Zentralblatt für Mathematik (1998)
Table of Contents
Basic Concepts of Linear Optimization. LINEAR OPTIMIZATION THEORY: BASIC TECHNIQUES. Geometry and Algebra of Feasible Regions. Dantzig’s Simplex Algorithm. Duality, Feasibility, and Optimality. Sensitivity Analysis. Large-Scale Linear Optimization. Integer Linear Optimization. Linear Network Models. Computational Complexity. LINEAR OPTIMIZATION PRACTICE: ADVANCED TECHNIQUES. Designing a Reservoir for Irrigation. Classifying Documents by Language. Production Planning; A Single Product Case. Production of Coffee Machines. Conflicting Objectives: Producing Versus Importing. Coalition Formation and Profit Distribution. Minimizing Trimloss When Cutting Cardboard. Off-Shore Helicopter Routing. The Catering Service Problem. Appendix A Mathematical Proofs. Appendix B Linear Algebra. Appendix C Graph Theory. Appendix D Convexity. Appendix E Nonlinear Optimization. Appendix F Writing LO-Models in GNU MathProg (GMPL). List of Symbols. Bibliography.
