20 pages matching Section 1.2 in this book
Results 1-3 of 20
What people are saying - Write a review
We haven't found any reviews in the usual places.
Solving Mathematical Programming Models
Building Linear Programming Models
12 other sections not shown
0-1 variables ACTIVITT 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 indicate industry infeasible input input-output models integer programming models integer solution integer variables involving IP model knapsack problem limited linear programming model logical conditions manpower master model mathematical programming model matrix Maximize minimize minimum cost MPSX naphtha necessary network flow nodes non-convex non-linear non-zero objective coefficient objective function objective value obtained optimal solution output package programs piecewise planning possible practical problems procedure PROD product mix profit contribution quantities ranges redundant represented result right-hand side coefficient Section 1.2 separable programming set covering problem set packing shadow prices simplex algorithm sometimes structure submodels subproblem SVEG tion tons OIL tons VEG totally unimodular transportation problem type of model unit valuations zero