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 74
Page 153
... ( described in Secs . 2.3 and 2.4 ) , and we usually have to do so a large number of times during the later stages of postoptimality analysis as well . One approach is simply to reapply the simplex method from scratch for each new version ...
... ( described in Secs . 2.3 and 2.4 ) , and we usually have to do so a large number of times during the later stages of postoptimality analysis as well . One approach is simply to reapply the simplex method from scratch for each new version ...
Page 254
... described in Secs . 4.7 and 6.2 , the optimal dual solution ( y , yž , . . . , y ) provides the shadow prices for the respective resources that indicate how Z would change if ( small ) changes were made in the b ; ( the re- source ...
... described in Secs . 4.7 and 6.2 , the optimal dual solution ( y , yž , . . . , y ) provides the shadow prices for the respective resources that indicate how Z would change if ( small ) changes were made in the b ; ( the re- source ...
Page 452
... described in Sec . 9.3 to solve this shortest- path problem . c ( c ) Formulate and solve a spreadsheet model for this problem . 9.3-6 . The Quick Company has learned that a competitor is plan- ning to come out with a new kind of ...
... described in Sec . 9.3 to solve this shortest- path problem . c ( c ) Formulate and solve a spreadsheet model for this problem . 9.3-6 . The Quick Company has learned that a competitor is plan- ning to come out with a new kind of ...
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