## Introduction to Operations Research, Volume 1CD-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 92

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 nodej ...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 A - B - C - D -- G HM FINISH START →→→→ EHM- → FINISH START →→ B > -FSK N → FINISH START → AB →→ EL N- FINISH START →→→→→→ N ...### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

Introduction to Operations Research Frederick S. Hillier,Gerald J. Lieberman No preview available - 2001 |

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