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 91
Page 409
... paths and undirected paths . A directed path from node i to node j is a sequence of con- necting arcs whose direction ( if any ) is toward node j , so that flow from node i to node j along this path is feasible . An undirected path from ...
... paths and undirected paths . A directed path from node i to node j is a sequence of con- necting arcs whose direction ( if any ) is toward node j , so that flow from node i to node j along this path is feasible . An undirected path from ...
Page 423
... 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 mini- mum of these residual capacities is called the residual capacity of the ...
... 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 mini- mum of these residual capacities is called the residual capacity of the ...
Page 476
Frederick S. Hillier, Gerald J. Lieberman. TABLE 10.2 The paths and path lengths through Reliable's project network Path START → A → BC → DG → H → M → FINISH START → A → B →→ C → E → H →→ M → FINISH START → A → B → C ...
Frederick S. Hillier, Gerald J. Lieberman. TABLE 10.2 The paths and path lengths through Reliable's project network Path START → A → BC → DG → H → M → FINISH START → A → B →→ C → E → H →→ M → FINISH START → A → B → C ...
Other editions - View all
Introduction to Operations Research Frederick S. Hillier,Gerald J. Lieberman No preview available - 2001 |
Common terms and phrases
activity algebraic algorithm allowable range artificial variables b₂ basic solution c₁ c₂ changes coefficients column Consider the following corresponding cost Courseware CPF solution CPLEX decision variables dual problem dynamic programming entering basic variable estimates example feasible region feasible solutions final simplex tableau final tableau flow following problem formulation functional constraints Gaussian elimination given graphical identify increase initial BF solution integer interior-point iteration leaving basic variable linear programming model linear programming problem LINGO LP relaxation lution Maximize subject Maximize Z maximum flow problem Minimize needed node nonbasic variables nonnegativity constraints objective function obtained optimal solution optimality test parameters path plant presented in Sec primal problem Prob procedure range to stay right-hand sides sensitivity analysis shadow prices simplex method slack variables solve the model Solver spreadsheet step subproblem surplus variables Table tion values weeks Wyndor Glass x₁ zero