Introduction to Operations Research, Volume 1-- This classic, field-defining text is the market leader in Operations Research -- and it's now updated and expanded to keep professionals a step ahead -- Features 25 new detailed, hands-on case studies added to the end of problem sections -- plus an expanded look at project planning and control with PERT/CPM -- A new, software-packed CD-ROM contains Excel files for examples in related chapters, numerous Excel templates, plus LINDO and LINGO files, along with MPL/CPLEX Software and MPL/CPLEX files, each showing worked-out examples |
From inside the book
Results 1-3 of 80
Page 176
Maximize Z = 2x1 + 3x2, subject to x1 + 2x2 < 30 x1 + x2 = 20 and x1 = 0, x2 = 0.
4.4-6. Consider the following problem. Maximize Z = 2x1 + 4x2 + 3x3, subject to
3x1 + 4x2 + 2x3 = 60 2x1 + x2 + 2x3 = 40 x1 + 3x2 + 2x3 < 80 and x3 = 0. x1 = 0,
...
Maximize Z = 2x1 + 3x2, subject to x1 + 2x2 < 30 x1 + x2 = 20 and x1 = 0, x2 = 0.
4.4-6. Consider the following problem. Maximize Z = 2x1 + 4x2 + 3x3, subject to
3x1 + 4x2 + 2x3 = 60 2x1 + x2 + 2x3 = 40 x1 + 3x2 + 2x3 < 80 and x3 = 0. x1 = 0,
...
Page 573
The cost (in hundreds of dollars) of installing one, two, or three parallel units in
the respective components is given by the following table: Maximize Z = x1x3x3,
0.5 subject to 0.7 0.9 .x1 + 2x2 + 3x3 = 10 x1 = 1, x2 = 1, x3 = 1, and x1, x2, x3 are
...
The cost (in hundreds of dollars) of installing one, two, or three parallel units in
the respective components is given by the following table: Maximize Z = x1x3x3,
0.5 subject to 0.7 0.9 .x1 + 2x2 + 3x3 = 10 x1 = 1, x2 = 1, x3 = 1, and x1, x2, x3 are
...
Page 574
Maximize Z = xix2, subject to xi + x2 = 2. (There are no nonnegativity constraints.)
Use dynamic programming to solve this problem. 11.3-20. Consider the following
nonlinear programming problem. Maximize Z = x + 4x3 + 16x3, subject to x1 x2 ...
Maximize Z = xix2, subject to xi + x2 = 2. (There are no nonnegativity constraints.)
Use dynamic programming to solve this problem. 11.3-20. Consider the following
nonlinear programming problem. Maximize Z = x + 4x3 + 16x3, subject to x1 x2 ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Common terms and phrases
activity additional algorithm alternative amount analysis apply assignment assumed basic variable begin BF solution 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 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 waiting weeks
Bibliographic information
| Title | Introduction to Operations Research, Volume 1 Introduction to Operations Research, Frederick S. Hillier 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 | 0072416181, 9780072416183 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |