Linear Programming and Network Flows - Couverture rigide

Bazaraa, M. S.; Jarvis, John Jeff

Couverture rigide

ISBN 10 : 0471636819 ISBN 13 : 9780471636816

Editeur : John Wiley and Sons (WIE), 1990

Synopsis

Thoroughly revised, this leading text on linear programming introduces new material on the simplex algorithm, polynomially- bounded algorithms and other algorithmic procedures. It gives ample consideration to the practical implementation of the simplex algorithm and its extensions, and features excellent coverage of Karmarkar's Algorithm, a new area of considerable research interest. The text contains all the material needed for not only a linear programming course but also a course on network flows.

A propos du livre

Quatrième de couverture

The authoritative guide to modeling and solving complex problems with linear programming extensively revised, expanded, and updated

The only book to treat both linear programming techniques and network flows under one cover, Linear Programming and Network Flows, Fourth Edition has been completely updated with the latest developments on the topic. This new edition continues to successfully emphasize modeling concepts, the design and analysis of algorithms, and implementation strategies for problems in a variety of fields, including industrial engineering, management science, operations research, computer science, and mathematics.

The book begins with basic results on linear algebra and convex analysis, and a geometrically motivated study of the structure of polyhedral sets is provided. Subsequent chapters include coverage of cycling in the simplex method, interior point methods, and sensitivity and parametric analysis. Newly added topics in the Fourth Edition include:

• The cycling phenomenon in linear programming and the geometry of cycling

• Duality relationships with cycling

• Elaboration on stable factorizations and implementation strategies

• Stabilized column generation and acceleration of Benders and Dantzig–Wolfe decomposition methods

• Line search and dual ascent ideas for the out–of–kilter algorithm

• Heap implementation comments, negative cost circuit insights, and additional convergence analyses for shortest path problems

The authors present concepts and techniques that are illustrated by numerical examples along with insights complete with detailed mathematical analysis and justification. An emphasis is placed on providing geometric viewpoints and economic interpretations as well as strengthening the understanding of the fundamental ideas. Each chapter is accompanied by Notes and References sections that provide historical developments in addition to current and future trends. Updated exercises allow readers to test their comprehension of the presented material, and extensive references provide resources for further study.

Linear Programming and Network Flows, Fourth Edition is an excellent book for linear programming and network flow courses at the upper–undergraduate and graduate levels. It is also a valuable resource for applied scientists who would like to refresh their understanding of linear programming and network flow techniques.

Quatrième de couverture

The best way to learn how to model and solve complex problems with linear programming

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.

Détails de l'édition

• Éditeur: John Wiley and Sons (WIE)
• Date d'édition: 1990
• ISBN 10: 0471636819
• ISBN 13: 9780471636816
• Reliure: Relié
• Langue: anglais
• Numéro d'édition: 2
• Nombre de pages: 704
• Coordonnées du fabricant: non disponible