Introduction to Operations ResearchCD-ROM contains: Student version of MPL Modeling System and its solver CPLEX -- MPL tutorial -- Examples from the text modeled in MPL -- Examples from the text modeled in LINGO/LINDO -- Tutorial software -- Excel add-ins: TreePlan, SensIt, RiskSim, and Premium Solver -- Excel spreadsheet formulations and templates. |
From inside the book
Results 1-3 of 80
Page 170
... gives the difference between the two sides of each constraint . The Dual Prices column gives , by another name , the shadow prices discussed in Sec . 4.7 for these constraints . ' ( This alternate name comes from the fact found in Sec ...
... gives the difference between the two sides of each constraint . The Dual Prices column gives , by another name , the shadow prices discussed in Sec . 4.7 for these constraints . ' ( This alternate name comes from the fact found in Sec ...
Page 231
... gives the coefficients of a single variable in the respective constraints and then in the objective function , whereas each row ( except the bottom one ) gives the param- eters for a single contraint . For the dual problem , each row ...
... gives the coefficients of a single variable in the respective constraints and then in the objective function , whereas each row ( except the bottom one ) gives the param- eters for a single contraint . For the dual problem , each row ...
Page 1121
... gives the duration of the project ( in weeks ) . One output cell gives this duration and the other indicates whether this duration meets the deadline by not ex- ceeding 47 weeks ( where 1 indicates yes and 0 indicates no ) . To run this ...
... gives the duration of the project ( in weeks ) . One output cell gives this duration and the other indicates whether this duration meets the deadline by not ex- ceeding 47 weeks ( where 1 indicates yes and 0 indicates no ) . To run this ...
Other editions - View all
Introduction to Operations Research Frederick S. Hillier,Gerald J. Lieberman No preview available - 2001 |
Common terms and phrases
activity algebraic algorithm allowable range artificial variables b₂ basic solution c₁ c₂ changes coefficients column Consider the following cost Courseware CPLEX decision variables described dual problem dynamic programming entering basic variable estimates example feasible region feasible solutions final simplex tableau final tableau flow following problem formulation functional constraints Gaussian elimination given graphical identify increase initial BF solution integer iteration leaving basic variable linear programming model linear programming problem LINGO LP relaxation lution Maximize Z maximum flow problem Minimize needed node nonbasic variables nonnegativity constraints objective function obtained optimal solution optimality test parameters path plant presented in Sec primal problem Prob procedure range to stay resource right-hand sides sensitivity analysis shadow prices shown simplex method slack variables solve the model Solver spreadsheet step subproblem surplus variables Table tion unit profit values weeks Wyndor Glass x₁ zero