What people are saying - Write a review
We haven't found any reviews in the usual places.
ChapterI Fundamental Concepts
ChapterIll Assignment and Distribution
ChapterIV Classical Optimization
11 other sections not shown
address ourselves arithmetic mean artificial variables associated basic feasible solution basic variables basis branch and bound cell Chapter city pair coefficients concave concave function condensed tableau convex convex function convex set determine dual dynamic programming element employed enumeration equality constraint Expression feasible region flow assignment goal gradient infeasible integer linear programming iteration kilter label node linear programming problem lower bound machine Maximize maximum method minimize minimum negative node labeled nonbasic variable nonlinear programming number of units objective function optimal optimum solution original tableau partial derivative partial solution period pivot column pivot row portrayed in Table predual primal profit represent resource schedule sequence shown in Table simplex algorithm simplex criteria simplex procedure sink slack variables slope solution values solve specified stage tableau in Table tour traveling salesman problem units of product upper bound XxX2 yield zero zero-one