Introduction to Operations Research, Volume 1-- This classic, field-defining text is the market leader in Operations Research -- and it's now updated and expanded to keep professionals a step ahead -- Features 25 new detailed, hands-on case studies added to the end of problem sections -- plus an expanded look at project planning and control with PERT/CPM -- A new, software-packed CD-ROM contains Excel files for examples in related chapters, numerous Excel templates, plus LINDO and LINGO files, along with MPL/CPLEX Software and MPL/CPLEX files, each showing worked-out examples |
From inside the book
Results 1-3 of 90
Page 409
of or all the arcs in the network are directed arcs , we then distinguish between
directed paths and undirected paths . A directed path from node i to node j is a
sequence of connecting arcs whose direction ( if any ) is toward node j , so that
flow ...
of or all the arcs in the network are directed arcs , we then distinguish between
directed paths and undirected paths . A directed path from node i to node j is a
sequence of connecting arcs whose direction ( if any ) is toward node j , so that
flow ...
Page 423
An augmenting path is a directed path from the source to the sink in the residual
network such that every arc on this path has strictly positive residual capacity .
The minimum of these residual capacities is called the residual capacity of the ...
An augmenting path is a directed path from the source to the sink in the residual
network such that every arc on this path has strictly positive residual capacity .
The minimum of these residual capacities is called the residual capacity of the ...
Page 476
TABLE 10.2 The paths and path lengths through Reliable's project network Path
Length START → AB →→→ GHM FINISH START →→→→→→→ FINISH START
→→→→ EA >>> N FINISH START A ~ B ~ ( E F ~~ - N ~ FINISH START A - B ...
TABLE 10.2 The paths and path lengths through Reliable's project network Path
Length START → AB →→→ GHM FINISH START →→→→→→→ FINISH START
→→→→ EA >>> N FINISH START A ~ B ~ ( E F ~~ - N ~ FINISH START A - B ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Common terms and phrases
activity additional algorithm alternative amount analysis apply assignment assumed basic variable begin BF solution 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 mean million Minimize month needed node objective function obtained operations optimal optimal solution original parameter path payoff 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 waiting weeks
Bibliographic information
| Title | Introduction to Operations Research, Volume 1 Introduction to Operations Research, Frederick S. Hillier 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 | the University of Michigan |
| Digitized | 8 Aug 2011 |
| ISBN | 0072416181, 9780072416183 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |