Linear programming and network flows

Front Cover
Wiley, 1990 - Mathematics - 684 pages
0 Reviews
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 inside the book

What people are saying - Write a review

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

Contents

INTRODUCTION
1
LINEAR ALGEBRA CONVEX ANALYSIS
38
THE SIMPLEX METHOD
81
Copyright

12 other sections not shown

Common terms and phrases

References to this book

All Book Search results »

About the author (1990)

Mokhtar S. BAZARAA, PhD, is a Professor at the 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 Institute and State University.

C. M. SHETTY, PhD, is a Professor Emeritus at the Georgia Institute of Technology.
Professors Bazaraa and Sherali are also coauthors of the complementary bestselling book, "Linear Programming and Network Flows," Third Edition, also published by Wiley.

Bibliographic information