## Model building in mathematical programming |

### From inside the book

Try this search over all volumes: **unserved load**

Results 1-0 of 0

### What people are saying - Write a review

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

### Contents

Introduction | 3 |

Solving Mathematical Programming Models | 10 |

Building Linear Programming Models | 18 |

Copyright | |

12 other sections not shown

### Other editions - View all

### Common terms and phrases

0-1 variables application arise assignment problem branch and bound clearly condition considered convex hull corresponding LP problem depot described in Section example extra constraints factory feasible region Figure following constraints formulation given grinding capacity impose increase industry infeasible input input-output models integer programming models integer solution integer variables involving IP model knapsack problem limited linear programming model logical condition manpower master model mathematical programming model matrix Maximize minimize minimum cost multi-period naphtha network flow node non-convex objective coefficients objective function obtained OIL3 optimal solution optimum output package programs planning possible practical problems procedure PROD PROD2 PROD3 PROD5 PROD6 PROD7 product mix profit contribution quadratic assignment problem quantities ranges redundant represented result right-hand side coefficient Section 1.2 separable programming set covering problem set packing shadow prices simplex algorithm solve specialized algorithm submodels subproblem tion tons OIL2 transportation problem type of model unimodular unit valuations VEG1 zero