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 83
Page 286
I|'l'6X2+5X3'l'7X4+X5sl5 and 1920, forj=l,2,3,4,5. 6.1-5. Consider the following
problem. Maximize Z = —x1 — 2x2 — x3, subject to X1'l"X2+2X35l2 X|+x;— X351
and X120, X220, X320. (a) Construct the dual problem. (b) Use duality theory to ...
I|'l'6X2+5X3'l'7X4+X5sl5 and 1920, forj=l,2,3,4,5. 6.1-5. Consider the following
problem. Maximize Z = —x1 — 2x2 — x3, subject to X1'l"X2+2X35l2 X|+x;— X351
and X120, X220, X320. (a) Construct the dual problem. (b) Use duality theory to ...
Page 288
Directly derive this solution, using Gaussian elimination. 6.3-7.* Reconsider the
model of Prob. 6.1-4b. (a) Construct its dual problem. (b) Solve this dual problem
graphically. (c) Use the result from part (b) to identify the nonbasic variables and
...
Directly derive this solution, using Gaussian elimination. 6.3-7.* Reconsider the
model of Prob. 6.1-4b. (a) Construct its dual problem. (b) Solve this dual problem
graphically. (c) Use the result from part (b) to identify the nonbasic variables and
...
Page 289
For each of the following linear programming models, use the SOB method to
construct its dual problem. ... form (see Table 6.12), then constructing its dual
problem, and next converting this dual problem to the form obtained in part (a).
6.4-8.
For each of the following linear programming models, use the SOB method to
construct its dual problem. ... form (see Table 6.12), then constructing its dual
problem, and next converting this dual problem to the form obtained in part (a).
6.4-8.
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 |