## Linear Programming |

### What people are saying - Write a review

User Review - Flag as inappropriate

great book

### Contents

Introduction | 1 |

Mathematical Background | 24 |

Theory of the Simplex Method | 71 |

Copyright | |

12 other sections not shown

### Other editions - View all

### Common terms and phrases

activity vector artificial variables artificial vectors assume basic feasible solution basis matrix basis vectors branch capacity cells Chapter column components compute Consider contains convex combination convex set corresponding cost degeneracy denoted destination discussed dual problem enter the basis equations example extreme point finite number given Hence hyperplane identity matrix industry inequalities initial basic feasible iteration labeled linear programming problem linearly independent loop maximal flow minimum nodes non-negative Note objective function obtain optimal basic solution optimal solution path Phase player primal problem primal-dual algorithm refinery removed restricted primal revised simplex method satisfied set of constraints set of feasible simplex algorithm slack variable solve surplus variables Table tableau tion transhipment transportation problem unbounded solution unique upper bounds vector to enter Vectors in Basis yield zero level