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 78
Page xxvii
13 , but the only background needed for this is presented in Appendix 4. For Chaps . 15 to 22 ( probabilistic models ) , a previous introduction to probability theory is assumed , and calculus is used in a few places .
13 , but the only background needed for this is presented in Appendix 4. For Chaps . 15 to 22 ( probabilistic models ) , a previous introduction to probability theory is assumed , and calculus is used in a few places .
Page 227
( a ) Use the fundamental insight presented in Sec . 5.3 to identify the missing numbers in the current simplex tableau . Show your calculations . ( b ) Indicate which of these missing numbers would be generated by the revised simplex ...
( a ) Use the fundamental insight presented in Sec . 5.3 to identify the missing numbers in the current simplex tableau . Show your calculations . ( b ) Indicate which of these missing numbers would be generated by the revised simplex ...
Page 405
For example , both the transportation problem and the assignment problem discussed in the preceding chapter fall into this category because of their network representations presented in Figs . 8.3 and 8.5 . One of the linear programming ...
For example , both the transportation problem and the assignment problem discussed in the preceding chapter fall into this category because of their network representations presented in Figs . 8.3 and 8.5 . One of the linear programming ...
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