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 76
Page 163
... approach to formulating and solving the model . Spreadsheets provide an excellent communication tool , especially ... APPROACH TO SOLVING LINEAR PROGRAMMING PROBLEMS The most dramatic new development in operations research during the ...
... approach to formulating and solving the model . Spreadsheets provide an excellent communication tool , especially ... APPROACH TO SOLVING LINEAR PROGRAMMING PROBLEMS The most dramatic new development in operations research during the ...
Page 167
... approach will be the most efficient , so it often is now used instead . As the size grows into the tens of thousands of functional constraints , the interior - point approach may be the only one capable of solv- ing the problem ...
... approach will be the most efficient , so it often is now used instead . As the size grows into the tens of thousands of functional constraints , the interior - point approach may be the only one capable of solv- ing the problem ...
Page 623
... approach to solving pure BIP problems that had successfully solved problems with no apparent special structure having up to 2,756 variables ! This paper won the Lan- chester Prize , awarded by the Operations Research Society of America ...
... approach to solving pure BIP problems that had successfully solved problems with no apparent special structure having up to 2,756 variables ! This paper won the Lan- chester Prize , awarded by the Operations Research Society of America ...
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