Model building in mathematical programming
Solving mathematical programming models. Building linear programming models. Structured linear programming models. Applications and special types of mathematical programming model. Interpreting and using the solution of a linear programming model. Non-linear models. Integer programming. Building integer programming models I. Building integer programming models II. The implementation of a mathematical programming system of planning. The problems. Formulation and discussion of problems. Solutions to problems. Index.
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
Other editions - View all
0-1 variables application arise assignment problem branch and bound clearly condition considered convex hull depot described in Section deviation discussed in Section drilling 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 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 package programs piecewise planning possible practical problems procedure PROD PRODI product mix profit contribution quantities ranges redundant represented result right-hand side coefficient rows Section 1.2 separable programming set covering problem set packing shadow prices simplex algorithm sometimes structure submodels subproblem tion tons OIL tons VEG totally unimodular transportation problem type of model valuations zero