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 71
Page 452
Use the alto be a shortest - path problem ? gorithm described in Sec . 9.4 to find the minimum spanning tree ( b ) Use the algorithm described in Sec . 9.3 to solve this shortest- for each of these networks . path problem . c ( c ) ...
Use the alto be a shortest - path problem ? gorithm described in Sec . 9.4 to find the minimum spanning tree ( b ) Use the algorithm described in Sec . 9.3 to solve this shortest- for each of these networks . path problem . c ( c ) ...
Page 740
14.5-5 and its hint ) that this linear programming problem and the one given for player 1 are dual to each other in the sense described in Secs . 6.1 and 6.4 . This fact has several important implications . One implication is that the ...
14.5-5 and its hint ) that this linear programming problem and the one given for player 1 are dual to each other in the sense described in Secs . 6.1 and 6.4 . This fact has several important implications . One implication is that the ...
Page 838
The only essential requirement for queueing theory to be applicable is that changes in the number of customers waiting for a given service occur just as though the physical situation described in Fig . 17.2 ( or a legitimate counterpart ) ...
The only essential requirement for queueing theory to be applicable is that changes in the number of customers waiting for a given service occur just as though the physical situation described in Fig . 17.2 ( or a legitimate counterpart ) ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
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 allocation allowable range artificial variables assignment problem augmenting path basic solution Big M method changes coefficients column Consider the following constraint boundary corresponding CPLEX decision variables 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 graphically identify increase initial BF solution integer interior-point iteration leaving basic variable linear programming model linear programming problem LP relaxation lution Maximize Maximize Z maximum flow problem Minimize needed node nonbasic variables objective function obtained optimal solution optimality test path Plant presented in Sec primal problem Prob procedure range to stay resource right-hand sides sensitivity analysis shadow prices slack variables solve this model Solver spreadsheet step subproblem surplus variables tion transportation problem transportation simplex method weeks Wyndor Glass x₁ zero
Bibliographic information
| Title | Introduction to Operations Research, Volume 1 Introduction to Operations Research, Frederick S. Hillier McGraw-Hill industrial & plant engineering series McGraw-Hill series in industrial engineering and management science |
| Authors | Frederick S. Hillier, Gerald J. Lieberman |
| Edition | 7, illustrated |
| Publisher | McGraw-Hill, 2001 |
| Original from | the University of Michigan |
| Digitized | 8 Aug 2011 |
| ISBN | 0072321695, 9780072321692 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |