## 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 89

Page 409

of or all the arcs in the network are directed arcs , we then distinguish between directed

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 ...Page 423

An augmenting

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 ...Page 476

TABLE 10.2 The

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 - C KN ...### 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 allowable amount apply assignment basic solution basic variable BF solution bound boundary called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution decision variables demand described determine distribution dual problem entering equal equations estimates example feasible feasible region FIGURE final flow formulation 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 remaining resource respective resulting shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit weeks Wyndor Glass zero