## Elementary Linear Programming with Applications, Volume 1The disk that comes with the book contains the student-oriented linear programming code SMPX, written by Professor Evar Nering of Arizona State University. The authors also recommend inexpensive linear programming software for personal computers. * More review material on linear algebra* Elementary linear programming covered more efficiently* Presentation improved, especially for the duality theorem, transportation problems, the assignment problem, and the maximal flow problem* New figures and exercises* Computer applications updated* Added disk with the student-oriented linear programming code SMPX, written by Professor Evar Nering of Arizona State University* New guide to inexpensive linear programming software for personal computers |

### What people are saying - Write a review

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

### Contents

CHAPTER 0 | 7 |

CHAPTER 1 | 45 |

INTRODUCTION TO LINEAR PROGRAMMING | 59 |

Copyright | |

6 other sections not shown

### Other editions - View all

Elementary Linear Programming with Applications Bernard Kolman,Robert Edward Beck Limited preview - 1995 |

### Common terms and phrases

0-ratios artificial variables augmented matrix basic feasible solution basic solution canonical form capacity cell coefficient Consider the linear constraints convex set corresponding cutting plane delay point denote departing variable directed arc dual problem dual variables entering variable equation EXAMPLE extreme point Figure final tableau finite inequality initial basic feasible initial tableau input integer programming problem kilogram labeled linear combination linear programming problem linear system linearly independent m x n matrix mathematical model minimization problem mixed integer programming negative entries node nonbasic variables nonnegative objective function objective row Operations Research optimal solution path pivotal column pivotal row primal problem profit programming problem Maximize real number reduced row echelon represents route row echelon form Section 2.1 Show simplex algorithm simplex method slack variable solve standard form Step subject to Ax subspace supersink supersource Suppose Theorem transportation problem zero