Linear Programming and Network Flows

Bazaraa, Mokhtar S.; Jarvis, John J.; Sherali, Hanif D.

ISBN 10: 0471636819 / ISBN 13: 9780471636816

Edité par Wiley, 1990

A propos de cet article

N° de réf. du vendeur SpeedList-4069

Détails bibliographiques

• Titre: Linear Programming and Network Flows
• Éditeur: Wiley
• Date de parution: 1990
• Langue: anglais
• ISBN à 10 chiffres: 0471636819
• ISBN à 13 chiffres: 9780471636816
• Reliure: Couverture rigide
• Édition: 2ème Édition
• État de l'article: Neuf

A propos de ce titre

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.

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.