What people are saying - Write a review
We haven't found any reviews in the usual places.
Fundamental Concepts Terminology and Examples
Mathematical Solution of Linear Programming Problems
Dual Simplex Method and Sensitivity
9 other sections not shown
Other editions - View all
activity algorithm allocation assembly assignment basic feasible solution basic solution basic variable batch branch and bound coefficients column components considered corresponding crash critical path decision variables demand destination deviational variables dual problem dynamic programming entering variable formulated free variables goal constraint goal programming infeasible initial solution integer linear programming inventory iteration linear programming model linear programming problem machine mathematical programming Maximize Minimize model building multiple-objective node nonbasic variable nondominated solutions nonnegative objective function Operations Research optimal solution optimal tableau partial solution period planning plant primal problem product-mix problem profit pure integer quantities resource revised model scheduling selected shadow prices shown in Fig shown in Table simplex algorithm simplex method simplex solution slack slack variables solution process solution space solution tableau solved stage Step stone method Subject subproblems surplus variable transshipment units of product zero