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 56
Page 429
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 ... Like the
maximum flow problem , it considers flow through a network with limited arc
capacities .
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 ... Like the
maximum flow problem , it considers flow through a network with limited arc
capacities .
Page 435
For much larger minimum cost flow problems , the network simplex method
described in the next section provides a considerably more efficient solution
procedure . It also is an attractive option for solving various special cases of the
minimum ...
For much larger minimum cost flow problems , the network simplex method
described in the next section provides a considerably more efficient solution
procedure . It also is an attractive option for solving various special cases of the
minimum ...
Page 436
Now consider the main version of the shortest - path problem presented in Sec . 9
. 3 ( finding the shortest path from one origin to one destination through an
undirected network ) . To formulate this problem as a minimum cost flow problem
...
Now consider the main version of the shortest - path problem presented in Sec . 9
. 3 ( finding the shortest path from one origin to one destination through an
undirected network ) . To formulate this problem as a minimum cost flow problem
...
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 |