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 354
... transportation problem for a product category shows what the distribution cost would be for shipping the product category from those plants to the distribution centers and customer zones . Numerous such transportation problems were ...
... transportation problem for a product category shows what the distribution cost would be for shipping the product category from those plants to the distribution centers and customer zones . Numerous such transportation problems were ...
Page 386
... Transportation problems in general have m + n − 1 basic variables ( allocations ) , so every BF solution for this particular kind of transportation problem has 2n - 1 basic variables , but exactly n of these x ,; equal 1 ( cor ...
... Transportation problems in general have m + n − 1 basic variables ( allocations ) , so every BF solution for this particular kind of transportation problem has 2n - 1 basic variables , but exactly n of these x ,; equal 1 ( cor ...
Page 400
... transportation simplex method to solve the Job Shop Co. assignment problem as formulated in Table 8.26b . ( As stated in Sec . 8.3 , the resulting optimal solution ... transportation problem ? 400 8 THE TRANSPORTATION AND ASSIGNMENT PROBLEMS.
... transportation simplex method to solve the Job Shop Co. assignment problem as formulated in Table 8.26b . ( As stated in Sec . 8.3 , the resulting optimal solution ... transportation problem ? 400 8 THE TRANSPORTATION AND ASSIGNMENT PROBLEMS.
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