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 74
Page 397
... apply the 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 ) ...
... apply the 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 ) ...
Page 718
... apply two iterations of the Frank- Wolfe algorithm . D.I 13.9-5 . Consider the quadratic programming example presented in Sec . 13.7 . Starting from the initial trial solution ( x1 , x2 ) = ( 5 , 5 ) , apply seven iterations of the ...
... apply two iterations of the Frank- Wolfe algorithm . D.I 13.9-5 . Consider the quadratic programming example presented in Sec . 13.7 . Starting from the initial trial solution ( x1 , x2 ) = ( 5 , 5 ) , apply seven iterations of the ...
Page 1043
... apply the method retrospectively to these data with different values of a and then choose the value of a that gives ... apply various statistical forecasting meth- ods retrospectively to the past three years of data and compare their MAD ...
... apply the method retrospectively to these data with different values of a and then choose the value of a that gives ... apply various statistical forecasting meth- ods retrospectively to the past three years of data and compare their MAD ...
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