## Operations research: applications and algorithms, Volume 1 |

### What people are saying - Write a review

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

### Contents

Introduction to Operations Research | 1 |

Introduction to Linear Programming | 45 |

The Simplex Algorithm | 110 |

Copyright | |

18 other sections not shown

### Other editions - View all

### Common terms and phrases

activity artificial variable balanced transportation problem barrels basic feasible solution basic variables basis remains optimal branch-and-bound coefficient in row column concave function convex convex function cost critical path current basis remains Dakota problem decision variables determine enter the basis equality constraint example extreme point feasible region Figure Find the dual finishing hours following LP Formulate an LP Golden Section Search increase infeasible integer programming investment knapsack problem labor linear programming LP relaxation matrix max problem maximize maximum flow problem maxz minimize minimum minimum spanning tree non-negative nonbasic variable objective function coefficient obtain optimal row optimal solution optimal tableau optimal z-value plant Powerco primal PROBLEMS GROUP profit programming problem random variable right-hand side satisfy Section shadow price shortest path shown in Table simplex algorithm simplex method STEP subproblem Suppose Theorem units vector yields zero