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 87
Page 370
... column 1 ( and eliminates this column from further consideration ) . This first iteration leaves a supply of 20 remaining in row 1 , so next select x1,1 + 1 = x12 to be a ba- sic variable . Because this supply is no larger than the ...
... column 1 ( and eliminates this column from further consideration ) . This first iteration leaves a supply of 20 remaining in row 1 , so next select x1,1 + 1 = x12 to be a ba- sic variable . Because this supply is no larger than the ...
Page 371
... column remaining un- der consideration is calculated and displayed , the largest difference is circled and the small- est unit cost in its row or column is enclosed in a box . The resulting selection ( and value ) of the variable having ...
... column remaining un- der consideration is calculated and displayed , the largest difference is circled and the small- est unit cost in its row or column is enclosed in a box . The resulting selection ( and value ) of the variable having ...
Page 413
... column are then listed in the second column for the current iteration after deleting those that are no longer directly connected to unsolved nodes . The candidates for nth nearest node next are listed in the third column for the cur ...
... column are then listed in the second column for the current iteration after deleting those that are no longer directly connected to unsolved nodes . The candidates for nth nearest node next are listed in the third column for the cur ...
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 cost CPF solution CPLEX decision variables described dual problem dynamic programming entering basic variable example feasible region feasible solutions final simplex tableau final tableau following problem formulation functional constraints Gaussian elimination given goal goal programming graphical identify increase initial BF solution integer interior-point iteration leaving basic variable linear programming model linear programming problem LINGO LP relaxation lution 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 shown simplex method slack variables solve the model Solver spreadsheet step subproblem surplus variables Table tion values weeks Wyndor Glass x₁ zero