Linear Programming and Network Flows

Front Cover
John Wiley & Sons, Aug 10, 2011 - Mathematics - 344 pages
0 Reviews
Linear Programming and Network Flows, now in its third edition, addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequility constraints. This book:
* Provides methods for modeling complex problems via effective algorithms on modern computers.
* Presents the general theory and characteristics of optimization problems, along with effective solution algorithms.
* Explores linear programming (LP) and network flows, employing polynomial-time algorithms and various specializations of the simplex method.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

ONE INTRODUCTION
1
TWO LINEAR ALGEBRA CONVEX ANALYSIS AND POLYHEDRAL SETS
45
THREE THE SIMPLEX METHOD
91
FOUR STARTING SOLUTION AND CONVERGENCE
151
FIVE SPECIAL SIMPLEX IMPLEMENTATIONS AND OPTIMALITY CONDITIONS
201
SIX DUALITY AND SENSITIVITY ANALYSIS
259
SEVEN THE DECOMPOSITION PRINCIPLE
339
EIGHT COMPLEXITY OF THE SIMPLEX ALGORITHM AND POLYNOMIALTIME ALGORITHMS
393
NINE MINIMALCOST NETWORK FLOWS
453
TEN THE TRANSPORTATION AND ASSIGNMENT PROBLEMS
513
ELEVEN THE OUTOFKILTER ALGORITHM
567
TWELVE MAXIMAL FLOW SHORTEST PATH MULTICOMMODITY FLOW AND NETWORK SYNTHESIS PROBLEMS
607
BIBLIOGRAPHY
681
INDEX
733
Copyright

Common terms and phrases

About the author (2011)

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).

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

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.

Bibliographic information