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 9
Frequently, much of the needed data will not be available when the study begins,
either because the information never has been kept or because what was kept is
outdated or in the wrong form. Therefore, it often is necessary to install a new ...
Frequently, much of the needed data will not be available when the study begins,
either because the information never has been kept or because what was kept is
outdated or in the wrong form. Therefore, it often is necessary to install a new ...
Page 166
For fairly small problems, the numbers of iterations needed by an interior-point
algorithm and by the simplex method tend to be somewhat comparable. For
example, on a problem with 10 functional constraints, roughly 20 iterations would
be ...
For fairly small problems, the numbers of iterations needed by an interior-point
algorithm and by the simplex method tend to be somewhat comparable. For
example, on a problem with 10 functional constraints, roughly 20 iterations would
be ...
Page 455
After production, the goods are stored in the company's two warehouses until
needed by the retail outlets. Trucks are used to transport the goods from the two
plants to the warehouses, and then from the warehouses to the three retail outlets
.
After production, the goods are stored in the company's two warehouses until
needed by the retail outlets. Trucks are used to transport the goods from the two
plants to the warehouses, and then from the warehouses to the three retail outlets
.
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 |
An Algorithm for the Assignment Problem | 18 |
Copyright | |
44 other sections not shown
Other editions - View all
Common terms and phrases
activity additional algorithm alternative amount analysis apply assigned assumed basic variable begin BF solution bound calculate called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution customers decision demand described determine developed distribution entering equations estimated example expected feasible FIGURE final flow formulation given gives hour identify illustrate increase indicates initial inventory iteration linear programming machine Maximize maximum mean million Minimize month needed node objective function obtained operations optimal optimal solution original parameter path payoff perform plant player possible presented Prob probability problem procedure profit programming problem queueing respectively resulting shown shows side simplex method solution solve step strategy Table tableau tion transportation unit weeks
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 |