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 81
Page 409
A directed path from node i to nodey is a sequence of connecting arcs whose
direction (if any) is toward node j, so that flow from node i to node / along this path
is feasible. An undirected path from node i to node j is a sequence of connecting
...
A directed path from node i to nodey is a sequence of connecting arcs whose
direction (if any) is toward node j, so that flow from node i to node / along this path
is feasible. An undirected path from node i to node j is a sequence of connecting
...
Page 419
The unconnected node closest to either node O or node A is node B (closest to A)
. Connect node B to node A. The unconnected node closest to node O, A, or B is
node C (closest to B). Connect node C to node B. The unconnected node ...
The unconnected node closest to either node O or node A is node B (closest to A)
. Connect node B to node A. The unconnected node closest to node O, A, or B is
node C (closest to B). Connect node C to node B. The unconnected node ...
Page 431
the network includes a dummy demand node that receives (at zero cost) all the
unused supply capacity at the vendors. ... This application involves a company
with several plants (the supply nodes) that can produce the same products but at
...
the network includes a dummy demand node that receives (at zero cost) all the
unused supply capacity at the vendors. ... This application involves a company
with several plants (the supply nodes) that can produce the same products but at
...
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 |