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 78
Page 408
The arcs of a network may have a flow of some type through them , e . g . , the
flow of trams on the roads of Seervada Park in Sec . 9 . 1 . Table 9 . 1 gives
several examples of flow in typical networks . If flow through an arc is allowed in
only one ...
The arcs of a network may have a flow of some type through them , e . g . , the
flow of trams on the roads of Seervada Park in Sec . 9 . 1 . Table 9 . 1 gives
several examples of flow in typical networks . If flow through an arc is allowed in
only one ...
Page 422
Maximize the flow of oil through a system of pipelines . 4 . Maximize the flow of
water through a system of aqueducts . 5 . Maximize the flow of vehicles through a
transportation network . For some of these applications , the flow through the ...
Maximize the flow of oil through a system of pipelines . 4 . Maximize the flow of
water through a system of aqueducts . 5 . Maximize the flow of vehicles through a
transportation network . For some of these applications , the flow through the ...
Page 429
spective arcs , these quantities are entered in the changing cells in column D (
cells D4 : D15 ) . Employing the equations given in the bottom right - hand corner
of the figure , these flows then are used to calculate the net flow generated at
each ...
spective arcs , these quantities are entered in the changing cells in column D (
cells D4 : D15 ) . Employing the equations given in the bottom right - hand corner
of the figure , these flows then are used to calculate the net flow generated at
each ...
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 |