Introduction to Operations ResearchCD-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 82
Page 317
Summary of the Parametric Linear Programming Procedure for Systematic
Changes in the fa, Parameters. 1. Solve the problem with 6 = 0 by the simplex
method. 2. Use the sensitivity analysis procedure (Case 1, Sec. 6.7) to introduce
the Abt ...
Summary of the Parametric Linear Programming Procedure for Systematic
Changes in the fa, Parameters. 1. Solve the problem with 6 = 0 by the simplex
method. 2. Use the sensitivity analysis procedure (Case 1, Sec. 6.7) to introduce
the Abt ...
Page 673
TABLE 13.1 Application of the one-dimensional search procedure to the example
Because the second derivative is nonpositive everywhere, f(x) is a concave
function, so the one-dimensional search procedure can be applied safely to find
its ...
TABLE 13.1 Application of the one-dimensional search procedure to the example
Because the second derivative is nonpositive everywhere, f(x) is a concave
function, so the one-dimensional search procedure can be applied safely to find
its ...
Page 678
TABLE 13.2 Application of the gradient search procedure to the example Iteration
x' Vf(x') x' + t W(x') f(x' + t W(x')) r* x' + r* W(x') 1 2 (0,0) (0,2) 0,0) (0, 2t) 4t-8r2 1 4 1
2 However, because this converging sequence of trial solutions never ...
TABLE 13.2 Application of the gradient search procedure to the example Iteration
x' Vf(x') x' + t W(x') f(x' + t W(x')) r* x' + r* W(x') 1 2 (0,0) (0,2) 0,0) (0, 2t) 4t-8r2 1 4 1
2 However, because this converging sequence of trial solutions never ...
What people are saying - Write a review
User Review - Flag as inappropriate
i
User Review - Flag as inappropriate
I want review this book
Contents
SUPPLEMENT TO APPENDIX 3 | 3 |
Problems | 6 |
An Algorithm for the Assignment Problem | 18 |
Copyright | |
44 other sections not shown
Other editions - View all
Common terms and phrases
activity additional algorithm alternative amount analysis apply assigned assumed basic variable begin BF solution bound calculate called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution customers decision demand described determine developed distribution entering equations estimated example expected feasible FIGURE final flow formulation given gives hour identify illustrate increase indicates initial inventory iteration linear programming machine Maximize maximum mean million Minimize month needed node objective function obtained operations optimal optimal solution original parameter path payoff perform plant player possible presented Prob probability problem procedure profit programming problem queueing respectively resulting shown shows side simplex method solution solve step strategy Table tableau tion transportation unit weeks
Bibliographic information
| Title | Introduction to Operations Research McGraw-Hill International Editions 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 | Pennsylvania State University |
| Digitized | 26 Aug 2009 |
| ISBN | 0071181636, 9780071181631 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |