Linear Programming and Network Flows

Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali - Collection Wiley-Interscience

726 pages, parution le 04/02/2005 (3^eme édition)

Ajouter à une liste

Indisponible

Résumé

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.

L'auteur - Mokhtar S. Bazaraa

MOKHTAR S. BAZARAA, PhD, is Managing Director for Global Logistics, The Logistics Institute, at Georgia Institute of Technology. He, along with Dr. Sherali, are coauthors of Nonlinear Programming: Theory and Algorithms (Wiley).

L'auteur - John J. Jarvis

JOHN J. JARVIS, PhD, is Professor Emeritus at Georgia Institute of Technology.

L'auteur - Hanif D. Sherali

HANIF D. SHERALI, PhD, is a W. Thomas Rice Chaired Professor of Engineering in the Grado Department of Industrial and Systems Engineering at Virginia Polytechnic and State University.

Sommaire

Introduction
Linear Algebra, Convex Analysis, and Polyhedral Sets
The Simplex Method
Starting Solution and Convergence
Special Simplex Implementations and Optimality Conditions
Duality and Sensitivity Analysis
The Decomposition Principle
Complexity of the Simplex Algorithms
Minimal-Cost Network Flows
The Transportation and Assignment Problems
The Out-of-Kilter Algorithm
Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Wiley
Auteur(s)	Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali
Collection	Wiley-Interscience
Parution	04/02/2005
Édition	3^eme édition
Nb. de pages	726
Format	16 x 24
Couverture	Relié
Poids	1152g
Intérieur	Noir et Blanc
EAN13	9780471485995
ISBN13	978-0-471-48599-5