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 71
Page 225
You are given the facts that the basic variables in the optimal solution are x2, x1,
and x5 and that 3 1 0 |- 1 1 11 –3 1 2 4 1 * 27 –6 9 –3 |. 0 1 3 2 –3 10 (a) Use the
given information to identify the optimal solution. (b) Use the given information to
...
You are given the facts that the basic variables in the optimal solution are x2, x1,
and x5 and that 3 1 0 |- 1 1 11 –3 1 2 4 1 * 27 –6 9 –3 |. 0 1 3 2 –3 10 (a) Use the
given information to identify the optimal solution. (b) Use the given information to
...
Page 289
Consider the two versions of the dual problem for the radiation therapy example
that are given in Tables 6.15 and 6.16. Review in Sec. 6.4 the general discussion
of why these two versions are completely equivalent. Then fill in the details to ...
Consider the two versions of the dual problem for the radiation therapy example
that are given in Tables 6.15 and 6.16. Review in Sec. 6.4 the general discussion
of why these two versions are completely equivalent. Then fill in the details to ...
Page 713
4.6 and then applying the KKT conditions as given in Sec. 13.6.) 13.6-13.
Consider the following nonlinear programming problem: Minimize z = 2»? + xi,
subject to xl + x; = I0 and x, 2 0, x; 2 0. (a) Of the special types of nonlinear
programming ...
4.6 and then applying the KKT conditions as given in Sec. 13.6.) 13.6-13.
Consider the following nonlinear programming problem: Minimize z = 2»? + xi,
subject to xl + x; = I0 and x, 2 0, x; 2 0. (a) Of the special types of nonlinear
programming ...
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 amount analysis apply approach assignment assumed basic variable begin BF solution calculate called changes column complete Consider constraints Construct corresponding cost CPF solution customers decision demand described determine developed distribution entering equations estimated example expected feasible FIGURE first flow formulation given gives hour identify illustrate increase indicates initial inventory involves iteration linear programming machine Maximize mean million Minimize month needed node objective function obtained operations optimal optimal solution original parameter path 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 |