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 65
Page 486
In reality , the duration of each activity is a random variable having some probability distribution . The original version of PERT took this uncertainty into account by using three different types of estimates of the duration of an ...
In reality , the duration of each activity is a random variable having some probability distribution . The original version of PERT took this uncertainty into account by using three different types of estimates of the duration of an ...
Page 879
a case except k = 1 ( exponential distribution ) , which has o = 1 / j . To illustrate a typical sit1 u a uation where o > 1/4 can occur , we suppose that the service involved in the queueing system is the repair of some kind of machine ...
a case except k = 1 ( exponential distribution ) , which has o = 1 / j . To illustrate a typical sit1 u a uation where o > 1/4 can occur , we suppose that the service involved in the queueing system is the repair of some kind of machine ...
Page 1146
( b ) Now do this by using the table for the normal distribution given in Appendix 5 and applying the inverse transformation method . R 22.4-15 . Obtaining uniform random numbers as instructed at the beginning of the Problems section ...
( b ) Now do this by using the table for the normal distribution given in Appendix 5 and applying the inverse transformation method . R 22.4-15 . Obtaining uniform random numbers as instructed at the beginning of the Problems section ...
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