# Linear Programming and Network Flows

## M. S. Bazaraa; John Jeff Jarvis

Valutazione media 5
( su 2 valutazioni fornite da Goodreads )

Thoroughly revised, this text on linear programming introduces new material on the simplex algorithm, polynomially-bounded algorithms and other algorithmic procedures. The book has been designed to provide material for both network flows and linear programming courses.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

From the Publisher:

Addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. Provided are methods for modeling complex problems via effective algorithms on modern computers. The general theory and characteristics of optimization problems are presented, along with effective solution algorithms. Explores linear programming and network flows, employing polynomial-time algorithms and various specializations of the simplex method. Includes many numerical examples to illustrate theory and techniques.

From the Back Cover:

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Compra nuovo Guarda l'articolo
EUR 146,92

Spese di spedizione: EUR 1,69
In U.S.A.

Destinazione, tempi e costi

Aggiungere al carrello

## 1.Linear Programming and Network Flows

Editore: John Wiley and Sons (WIE) (1989)
ISBN 10: 0471512842 ISBN 13: 9780471512844
Nuovi Paperback Quantità: 1
Da
Murray Media
(North Miami Beach, FL, U.S.A.)
Valutazione libreria

Descrizione libro John Wiley and Sons (WIE), 1989. Paperback. Condizione libro: New. Codice libro della libreria P110471512842

Compra nuovo
EUR 146,92
Convertire valuta
Spese di spedizione: EUR 1,69
In U.S.A.
Destinazione, tempi e costi