Linear programming / Vašek Chvátal.

Format:

Book

Author/Creator:

Chvátal, Vašek, 1946-

Series:

Series of books in the mathematical sciences

Series of books in the mathematical sciences.

Language:

English

Subjects (All):

Linear programming.

Physical Description:

xiii, 478 pages : illustrations ; 24 cm.

Place of Publication:

New York : W.H. Freeman, [1983]

Summary:

For upper-division/graduate courses in operations research/management science, mathematics, and computer science, this text covers basic theory, selected applications, network flow problems, and advanced techniques.

Contents:

I Basic Theory

1 Introduction

2 How the Simplex Method Works

3 Pitfalls and How to Avoid Them

4 How Fast Is the Simplex Method?

5 The Duality Theorem

6 Gaussian Elimination and Matrices

7 The Revised Simplex Method

8 General LP Problems: Solutions by the Simplex Method

9 General LP Problems: Theorems on Duality and Infeasibility

10 Sensitivity Analysis

II Selected Applications

11 Efficient Allocation of Scarce Resources

12 Scheduling Production and Inventory

13 The Cutting-Stock Problem

14 Approximating Data by Linear Functions

15 Matrix Games

16 Systems of Linear Inequalities

17 Connections with Geometry

18 Finding All Vertices of a Polyhedron

III Network Flow Problems

19 The Network Simplex Method

20 Applications of the Network Simplex Method

21 Upper-Bounded Transshipment Problems

22 Maximum Flows Through Networks

23 The Primal-Dual Method

IV Advanced Techniques

24 Updating a Triangular Factorization of the Basis

25 Generalized Upper Bounding

26 The Dantzig-Wolfe Decomposition Principle.

Notes:

Includes index.

Bibliography: pages 455-464.

ISBN:

0716711958

0716715872

OCLC:

9081664