Introduction to Operations Research, Volume 1CD-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 72
Page 298
Consider the following four cases where the true values of b , and b2 differ from their estimates by the same percentage : ( 1 ) both b , and b2 are smaller than their estimates , ( 2 ) both b , and b2 are larger than their estimates ...
Consider the following four cases where the true values of b , and b2 differ from their estimates by the same percentage : ( 1 ) both b , and b2 are smaller than their estimates , ( 2 ) both b , and b2 are larger than their estimates ...
Page 487
Similarly , an approximate formula for u is M = 0 + 4m + P р 6 Intuitively , this formula is placing most of the weight on the most likely estimate and then small equal weights on the other two estimates . MS Project provides the option ...
Similarly , an approximate formula for u is M = 0 + 4m + P р 6 Intuitively , this formula is placing most of the weight on the most likely estimate and then small equal weights on the other two estimates . MS Project provides the option ...
Page 517
Using the PERT three - estimate approach , the three estimates for one of the activities are as follows : optimistic estimate = 30 days , most likely estimate 36 days , pessimistic estimate = 48 days . What are the resulting estimates ...
Using the PERT three - estimate approach , the three estimates for one of the activities are as follows : optimistic estimate = 30 days , most likely estimate 36 days , pessimistic estimate = 48 days . What are the resulting estimates ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Introduction to Operations Research Frederick S. Hillier,Gerald J. Lieberman No preview available - 2001 |
Common terms and phrases
activity additional algorithm allowable amount apply assignment basic solution basic variable BF solution bound boundary called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution decision variables demand described determine direction distribution dual problem entering equal equations estimates example feasible feasible region FIGURE final flow formulation functional constraints given gives goal identify illustrate increase indicates initial iteration linear programming Maximize million Minimize month needed node nonbasic variables objective function obtained operations optimal optimal solution original parameters path Plant possible presented primal problem Prob procedure profit programming problem provides range remaining resource respective resulting shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit weeks Wyndor Glass zero