The third edition of this popular textbook brings it completely up-to-date with the latest developments in linear programming and network flows. With an emphasis on modeling concepts, the design of algorithms, and implementation strategies, readers discover how to model complex problems and solve them using the latest technology. Following an introductory first chapter, the second chapter presents basic results on linear algebra and convex analysis, along with an insightful, geometrically motivated study of the structure of polyhedral sets. The remainder of the text is divided into two parts: linear programming and network flows. Throughout the text, the authors first present concepts and techniques, illustrated by numerical examples, and then provide further insights complete with detailed mathematical analysis and justification. Exercises from the previous edition have been thoroughly revised and many new exercises have been added.

• New content offers the latest information on key topics including modeling languages and software, anti-cycling rules, Affine Scaling methods, primal-dual path following and relaxation methods, and pre-flow push algorithms for max flow
• Novel network flow problems, such as designing water supply systems, communication systems, and railroad and highway traffic patterns, are used as illustrative examples to analyze solution methods
• Notes, included with each chapter, share the latest insights into both historical context and future trends
• References lead readers to in-depth discussion and analysis of particular topics
• Revised and updated exercises demonstrate the practical application of theories and concepts presented in the text

The authors' rigorous attention to detail and easy-to-follow writing style enable readers to apply their newfound knowledge to solve problems in a variety of fields, including industrial engineering, management, operations, computer science, and mathematics.