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 85
Page 69
Each functional constraint The spreadsheet layout shown in Fig. 3.14 includes all
these components. The parameters for the functional constraints are in rows 5, 6,
and 7, and the coefficients for the objective function are in row 8. The values of ...
Each functional constraint The spreadsheet layout shown in Fig. 3.14 includes all
these components. The parameters for the functional constraints are in rows 5, 6,
and 7, and the coefficients for the objective function are in row 8. The values of ...
Page 215
1 0 1 0 0 0 Writing this second tableau as the matrix product shown for iteration 1
(namely, the corresponding matrix times rows 1 to 3 of the initial tableau) then
yields Final rows 1-3 0 \ 2 4 12 18 4 12 •8 2' 6 2 The first two matrices shown on ...
1 0 1 0 0 0 Writing this second tableau as the matrix product shown for iteration 1
(namely, the corresponding matrix times rows 1 to 3 of the initial tableau) then
yields Final rows 1-3 0 \ 2 4 12 18 4 12 •8 2' 6 2 The first two matrices shown on ...
Page 283
In the feasible region shown in Fig. 6.3, the geometric interpretation of changing
the objective function from Z = 3xi + 5x2 to Z(0) = (3 + 8)x\ + (5 — 28)x2 is that we
are changing the slope of the original objective function line (Z = 45 = 3jc, + 5x2)
...
In the feasible region shown in Fig. 6.3, the geometric interpretation of changing
the objective function from Z = 3xi + 5x2 to Z(0) = (3 + 8)x\ + (5 — 28)x2 is that we
are changing the slope of the original objective function line (Z = 45 = 3jc, + 5x2)
...
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 |