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 365
... SIMPLEX METHOD FOR THE TRANSPORTATION PROBLEM Because the transportation problem is just a special type of linear ... SIMPLEX METHOD FOR THE TRANSPORTATION PROBLEM 365 A Streamlined Simplex Method for the Transportation Problem.
... SIMPLEX METHOD FOR THE TRANSPORTATION PROBLEM Because the transportation problem is just a special type of linear ... SIMPLEX METHOD FOR THE TRANSPORTATION PROBLEM 365 A Streamlined Simplex Method for the Transportation Problem.
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 simplex method to obtain an optimal solution . D , I ( d ) Use Vogel's approximation method to obtain an initial BF solution for this problem . DI ( e ) Starting with the initial BF solution from part ( d ) , interac ...
... transportation simplex method to obtain an optimal solution . D , I ( d ) Use Vogel's approximation method to obtain an initial BF solution for this problem . DI ( e ) Starting with the initial BF solution from part ( d ) , interac ...
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