Model Building in Mathematical Programming |
Contents
Building Linear Programming Models | 3 |
Structured Linear Programming Models | 36 |
183 | 50 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
0-1 variables allocation application arcs arise assignment problem branch and bound clearly coal condition considered convex hull depot described in Section discussed in Section example factory feasible region Figure formulation give rise given impose industry infeasible input input-output models integer programming models integer solution integer variables involving IP model knapsack problem LHAR limited linear programming model logical condition manpower mathematical programming model matrix Maximize method minimize multi-period naphtha network flow network flow problem node objective coefficients objective function objective value obtained OIL3 optimal solution output package programs planning possible practical problems procedure PROD PROD2 PROD3 PROD5 profit contribution programming problem quadratic assignment problem quantities ranges represented requirement restricted master model right-hand side coefficient Section 1.2 set covering problem set packing shadow prices simplex algorithm solve specialized algorithm submodels tion tons OIL2 transhipment transportation problem type of model unit upper bound valuations VEG1 x₁ y₁ zero