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 67
Page 395
... solution . 8.2-1 . Consider the transportation problem having the following parameter table : 1 2 3 4 5 6 Supply ... initial BF solution . ( b ) Use Russell's approximation method manually to select the first basic variable for an ...
... solution . 8.2-1 . Consider the transportation problem having the following parameter table : 1 2 3 4 5 6 Supply ... initial BF solution . ( b ) Use Russell's approximation method manually to select the first basic variable for an ...
Page 397
... initial BF solu- tion for this problem . D.I ( c ) Starting with the initial BF solution from part ( b ) , interac- tively apply the transportation simplex method to obtain an optimal solution . D , I ( d ) Use Vogel's approximation ...
... initial BF solu- tion for this problem . D.I ( c ) Starting with the initial BF solution from part ( b ) , interac- tively apply the transportation simplex method to obtain an optimal solution . D , I ( d ) Use Vogel's approximation ...
Page 457
... basic arcs . ( b ) Use the optimality test to verify that this initial BF solution is optimal and that there are multiple optimal solutions . Apply one iteration of the network simplex method to find the other optimal BF solution , and ...
... basic arcs . ( b ) Use the optimality test to verify that this initial BF solution is optimal and that there are multiple optimal solutions . Apply one iteration of the network simplex method to find the other optimal BF solution , and ...
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