## Linear and combinatorial programming |

### What people are saying - Write a review

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

### Contents

FORMULATION OF LINEAR PROGRAMS | 1 |

THE SIMPLEX METHOD | 35 |

THE GEOMETRY OF THE SIMPLEX METHOD | 75 |

Copyright | |

16 other sections not shown

### Other editions - View all

### Common terms and phrases

admissible cells algorithm terminates artificial variables assignment problem associated basic set basic variable branch and bound candidate problem canonical tableau Cholesky factor column vector complementary feasible computed convex cutting plane dual feasible dual simplex dual solution edge entering variable entries equal equations Example extreme point feasible basic vector feasible basis feasible flow vector Figure Hence infeasible integer program inverse tableau Lagrange multiplier linear programming linearly independent LU decomposition matrix of order maximum flow problem Minimize z(x minimum cost minimum objective value node nonbasic variable nonnegative nonzero objective function obtained optimal optimum feasible solution optimum solution original problem P-matrix pair Phase I problem pivot column pivot row pivot step primal feasible relative cost coefficients satisfies set of feasible shortest chains simplex algorithm simplex method slack variables solving stage Subject to Ax subset Suppose theorem transportation array transportation problem zero