Linear Programming and Network Flows / Edition 2

Linear Programming and Network Flows / Edition 2

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

This work addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. It provides 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. The text

See more details below

Overview

This work addresses the problem of minimizing or maximizing a linear function in the presence of linear equality or inequality constraints. It provides 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. The text also 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.

Product Details

ISBN-13:
9780471636816
Publisher:
Wiley
Publication date:
10/28/1989
Edition description:
Older Edition
Pages:
704
Product dimensions:
6.42(w) x 9.52(h) x 1.18(d)

Table of Contents

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 Algorithm and Polynomial 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.

Bibliography.

Index.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >