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 51
Page 907
... queueing theory is not directly concerned with achieving the goal of OR : optimal decision making . Rather , it develops information on the behavior of queueing sys- tems . This theory provides part of the information needed to conduct ...
... queueing theory is not directly concerned with achieving the goal of OR : optimal decision making . Rather , it develops information on the behavior of queueing sys- tems . This theory provides part of the information needed to conduct ...
Page 926
... queueing system ) and many more complicated situations ( e.g. , designing a priority queueing system ) that can also be ana- lyzed in a similar way . Another useful area for the application of queueing theory is the development of poli ...
... queueing system ) and many more complicated situations ( e.g. , designing a priority queueing system ) that can also be ana- lyzed in a similar way . Another useful area for the application of queueing theory is the development of poli ...
Page 1210
... Queueing simulation , 1096 Queueing Simulator , 1131 Queueing systems , 834 , 835 design and operation of , 1097-1098 design decisions , 909 Queueing theory , 64 , 834-890 applications award - winning , 923-926 conclusions , 926 ...
... Queueing simulation , 1096 Queueing Simulator , 1131 Queueing systems , 834 , 835 design and operation of , 1097-1098 design decisions , 909 Queueing theory , 64 , 834-890 applications award - winning , 923-926 conclusions , 926 ...
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