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 72
Page 102
( a ) Use MPL / CPLEX to formulate and solve the model for this problem . ( b )
Use LINGO to formulate and solve this model . The net sales revenue ( selling
price minus normal shipping costs ) the company receives when a plant sells the
...
( a ) Use MPL / CPLEX to formulate and solve the model for this problem . ( b )
Use LINGO to formulate and solve this model . The net sales revenue ( selling
price minus normal shipping costs ) the company receives when a plant sells the
...
Page 454
( a ) Formulate this problem as a maximum flow problem by identifying a source ,
a sink , and the transshipment nodes , and then drawing the complete network
that shows the capacity of each arc . ( b ) Use the augmenting path algorithm ...
( a ) Formulate this problem as a maximum flow problem by identifying a source ,
a sink , and the transshipment nodes , and then drawing the complete network
that shows the capacity of each arc . ( b ) Use the augmenting path algorithm ...
Page 455
C ( b ) Formulate and solve a spreadsheet model for this problem . From 9 . 6 - 1 .
Reconsider the maximum flow problem shown in Prob . 9 . 5 - 6 . Formulate this
problem as a minimum cost flow problem , including adding the arc A → F . .
C ( b ) Formulate and solve a spreadsheet model for this problem . From 9 . 6 - 1 .
Reconsider the maximum flow problem shown in Prob . 9 . 5 - 6 . Formulate this
problem as a minimum cost flow problem , including adding the arc A → F . .
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 | |
57 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 calculations called capacity changes coefficients column complete Consider constraints construct corresponding cost CPF solution demand described determine direction distribution dual problem entering equal equations estimates example feasible FIGURE final flow problem Formulate 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 resource respective resulting revised Select 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 |