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 86
Page 422
For each of these other nodes , a new arc is inserted that leads from the dummy
source to this node , where the capacity of this arc equals the maximum flow that ,
in reality , can originate from this node . Similarly , the dummy sink is treated as ...
For each of these other nodes , a new arc is inserted that leads from the dummy
source to this node , where the capacity of this arc equals the maximum flow that ,
in reality , can originate from this node . Similarly , the dummy sink is treated as ...
Page 423
6 01 C E 4 capacity in the original direction remains the same and the arc
capacity in the opposite direction is zero , so the constraints on flows are
unchanged . Subsequently , whenever some amount of flow is assigned to an arc
, that amount ...
6 01 C E 4 capacity in the original direction remains the same and the arc
capacity in the opposite direction is zero , so the constraints on flows are
unchanged . Subsequently , whenever some amount of flow is assigned to an arc
, that amount ...
Page 426
If we use the latter method , there is flow along an arc if the final residual capacity
is less than the original capacity . The magnitude of this flow equals the
difference in these capacities . Applying this method by comparing the residual
network ...
If we use the latter method , there is flow along an arc if the final residual capacity
is less than the original capacity . The magnitude of this flow equals the
difference in these capacities . Applying this method by comparing the residual
network ...
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 |