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 84
Page 385
... example can be solved very quickly by the general simplex method , so it may be convenient to simply use a basic software package ( such as Excel and its Solver ) that only employs this method . If this were done for the Job Shop Co ...
... example can be solved very quickly by the general simplex method , so it may be convenient to simply use a basic software package ( such as Excel and its Solver ) that only employs this method . If this were done for the Job Shop Co ...
Page 811
... example , the Markov chain is irreducible . In the first stock example in Sec . 16.2 , the Markov chain is irreducible . The gambling example contains three classes . State O forms a class , state 3 forms a class , and states 1 and 2 ...
... example , the Markov chain is irreducible . In the first stock example in Sec . 16.2 , the Markov chain is irreducible . The gambling example contains three classes . State O forms a class , state 3 forms a class , and states 1 and 2 ...
Page 1206
... example , 826-827 formulation , 822-823 key random variables , 823-825 steady - state probabilities , 825-827 first passage times , 818-820 formulating example , 805–807 gambling example , 807-808 inventory example , 803 irreducible ...
... example , 826-827 formulation , 822-823 key random variables , 823-825 steady - state probabilities , 825-827 first passage times , 818-820 formulating example , 805–807 gambling example , 807-808 inventory example , 803 irreducible ...
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