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 93
Page 386
... transportation simplex method is applied to this transportation problem formulation , the resulting optimal so- lution has basic variables x13 = 0 , X14 = 1 , X23 1 , X31 1 , X41 = 0 , X42 1 , X43 = 0 . ( You are asked to verify this ...
... transportation simplex method is applied to this transportation problem formulation , the resulting optimal so- lution has basic variables x13 = 0 , X14 = 1 , X23 1 , X31 1 , X41 = 0 , X42 1 , X43 = 0 . ( You are asked to verify this ...
Page 396
... transportation simplex method to obtain an optimal solution . 8.2-5 . Consider the prototype example for the transportation prob- lem ( the P & T Co. problem ) presented at the beginning of Sec . 8.1 . Verify that the solution given ...
... transportation simplex method to obtain an optimal solution . 8.2-5 . Consider the prototype example for the transportation prob- lem ( the P & T Co. problem ) presented at the beginning of Sec . 8.1 . Verify that the solution given ...
Page 397
... transportation problem by con- structing the appropriate parameter table . D , I ( b ) Use the northwest corner rule to obtain an initial BF solu- tion for this problem . DI ( c ) Starting with the initial BF solution from part ( b ) ...
... transportation problem by con- structing the appropriate parameter table . D , I ( b ) Use the northwest corner rule to obtain an initial BF solu- tion for this problem . DI ( c ) Starting with the initial BF solution from part ( b ) ...
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