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 58
Page 533
Frederick S. Hillier, Gerald J. Lieberman. 11 Dynamic Programming 11.1 EXAMPLE 1 Dynamic programming is a useful mathematical technique for making a sequence of in ... Dynamic Programming A Prototype Example for Dynamic Programming.
Frederick S. Hillier, Gerald J. Lieberman. 11 Dynamic Programming 11.1 EXAMPLE 1 Dynamic programming is a useful mathematical technique for making a sequence of in ... Dynamic Programming A Prototype Example for Dynamic Programming.
Page 568
... Dynamic programming is a very useful technique for making a sequence of interrelated decisions . It requires ... programming need make no more than a thousand calculations ( 10 for each state at each stage ) . This chapter has ...
... Dynamic programming is a very useful technique for making a sequence of interrelated decisions . It requires ... programming need make no more than a thousand calculations ( 10 for each state at each stage ) . This chapter has ...
Page 574
... dynamic programming to solve this problem . 11.4-2 . Imagine that you have $ 5,000 to invest and that you will have an opportunity to invest that amount in either of two invest- ments ( A or B ) at the beginning of 574 11 DYNAMIC ...
... dynamic programming to solve this problem . 11.4-2 . Imagine that you have $ 5,000 to invest and that you will have an opportunity to invest that amount in either of two invest- ments ( A or B ) at the beginning of 574 11 DYNAMIC ...
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