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 55
Page 408
... direction ( e.g. , a pipeline that can be used to pump fluid in either direction ) , the arc is said to be an undirected arc . To help you distinguish between the two kinds of arcs , we shall frequently refer to undirected arcs by the ...
... direction ( e.g. , a pipeline that can be used to pump fluid in either direction ) , the arc is said to be an undirected arc . To help you distinguish between the two kinds of arcs , we shall frequently refer to undirected arcs by the ...
Page 409
... 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 node i to node j is a sequence of connecting arcs whose direction ( if any ) can be either toward or away ...
... 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 node i to node j is a sequence of connecting arcs whose direction ( if any ) can be either toward or away ...
Page 423
... 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 is subtracted from the ...
... 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 is subtracted from the ...
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