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 79
Page 153
We nearly always have to solve again several times during the model debugging stage ( 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 .
We nearly always have to solve again several times during the model debugging stage ( 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 .
Page 160
The procedure is described in Sec . 7.2 . 4.8 COMPUTER IMPLEMENTATION If the electronic computer had never been invented , undoubtedly you would have never heard of linear programming and the simplex method . Even though it is possible ...
The procedure is described in Sec . 7.2 . 4.8 COMPUTER IMPLEMENTATION If the electronic computer had never been invented , undoubtedly you would have never heard of linear programming and the simplex method . Even though it is possible ...
Page 452
Use the alto be a shortest - path problem ? gorithm described in Sec . 9.4 to find the minimum spanning tree ( b ) Use the algorithm described in Sec . 9.3 to solve this shortest- for each of these networks . path problem . 9.4-2 .
Use the alto be a shortest - path problem ? gorithm described in Sec . 9.4 to find the minimum spanning tree ( b ) Use the algorithm described in Sec . 9.3 to solve this shortest- for each of these networks . path problem . 9.4-2 .
What people are saying - Write a review
User Review - Flag as inappropriate
i
User Review - Flag as inappropriate
I want review this book
Contents
SUPPLEMENT TO APPENDIX 3 | 3 |
Problems | 6 |
SUPPLEMENT TO CHAPTER | 18 |
Copyright | |
52 other sections not shown
Other editions - View all
Common terms and phrases
activity additional algorithm allocation allowable amount apply assignment basic solution basic variable BF solution bound boundary called changes coefficients column complete Consider constraint Construct corresponding cost CPF solution decision variables demand described determine distribution dual problem entering equal equations estimates example feasible feasible region feasible solutions 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 revised shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit values weeks Wyndor Glass zero
Bibliographic information
| Title | Introduction to Operations Research McGraw-Hill International Editions McGraw-Hill industrial & plant engineering series McGraw-Hill series in industrial engineering and management science |
| Authors | Frederick S. Hillier, Gerald J. Lieberman |
| Edition | 7, illustrated |
| Publisher | McGraw-Hill, 2001 |
| Original from | Pennsylvania State University |
| Digitized | 26 Aug 2009 |
| ISBN | 0071181636, 9780071181631 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |