- 555 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
About this book
Linear Optimization and Dualiyy: A Modern Exposition departs from convention in significant ways. Standard linear programming textbooks present the material in the order in which it was discovered. Duality is treated as a difficult add-on after coverage of formulation, the simplex method, and polyhedral theory. Students end up without knowing duality in their bones.
This text brings in duality in Chapter 1 and carries duality all the way through the exposition. Chapter 1 gives a general definition of duality that shows the dual aspects of a matrix as a column of rows and a row of columns. The proof of weak duality in Chapter 2 is shown via the Lagrangian, which relies on matrix duality. The first three LP formulation examples in Chapter 3 are classic primal-dual pairs including the diet problem and 2-person zero sum games.
For many engineering students, optimization is their first immersion in rigorous mathematics. Conventional texts assume a level of mathematical sophistication they don't have. This text embeds dozens of reading tips and hundreds of answered questions to guide such students.
Features
- Emphasis on duality throughout
- Practical tips for modeling and computation
- Coverage of computational complexity and data structures
- Exercises and problems based on the learning theory concept of the zone of proximal
development
- Guidance for the mathematically unsophisticated reader
About the Author
Craig A. Tovey is a professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Institute of Technology. Dr. Tovey received an AB from Harvard College, an MS in computer science and a PhD in operations research from Stanford University. His principal activities are in operations research and its interdisciplinary applications. He received a Presidential Young Investigator Award and the Jacob Wolfowitz Prize for research in heuristics. He was named an Institute Fellow at Georgia Tech, and was recognized by the ACM Special Interest Group on Electronic Commerce with the Test of Time Award. Dr. Tovey received the 2016 Golden Goose Award for his research on bee foraging behavior leading to the development of the Honey Bee Algorithm.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Half Title
- Title Page
- Copyright Page
- Contents
- Preface
- About the Author
- To the Teacher
- To the Reader
- List of Symbols
- Glossary
- 1 A Gentle Introduction to Optimization and Duality
- 2 Introduction to Linear Programming
- 3 Formulating and Solving Linear Programs
- 4 Polyhedra
- 5 The Simplex Method
- 6 Variants of the Simplex Method
- 7 Shadow Prices, Sensitivity Analysis, and Column Generation
- 8 Advanced Topics on Polyhedra
- 9 Polynomial Time Algorithms
- 10 Speed of the Simplex Method and Complexity of Linear Programming
- 11 Network Models and the Network Simplex Algorithm
- 12 Shortest Path Models and Algorithms
- 13 Specialized Algorithms for Maximum Flow and Minimum Cut
- 14 Computational Complexity
- 16 Elementary Nonlinear Programming Theory
- 17 Introduction to Nonlinear Programming Algorithms
- 18 Affine Scaling and Logarithmic Barrier Interior-Point Methods
- 19 Appendices
- Bibliography
- Index