Model Building in Mathematical Programming |
Contents
Building Linear Programming Models | 3 |
Applications and Special Types of Mathematical Programming | 56 |
Interpreting and Using the Solution of a Linear Programming | 85 |
Copyright | |
9 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 depot described in Section example extra constraints factory feasible region Figure following constraints formulation given grinding capacity impose increase 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 naphtha network flow node non-convex non-linear objective coefficients objective function obtained OIL1 OIL3 optimal solution output package programs planning possible practical problems procedure PROD PROD2 PROD3 PROD4 PROD5 PROD6 PROD7 product mix profit contribution quadratic assignment problem quantities ranges represented result right-hand side coefficient Section 1.2 separable programming set covering problem set packing shadow prices simplex algorithm solve submodels subproblem tion tons OIL2 tons VEG2 total profit transportation problem type of model unit valuations VEG1 x₁ y₁ zero