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 77
Page 174
Describe graphically what the simplex method does step by step to solve the
following problem . Minimize Z = 5x1 + 7x2 , subject to 4.2-2 . Reconsider the
model in Prob . 4.1-5 . Follow the instructions of Prob . 4.2-1 for parts ( a ) , ( b ) ,
and ( c ) ...
Describe graphically what the simplex method does step by step to solve the
following problem . Minimize Z = 5x1 + 7x2 , subject to 4.2-2 . Reconsider the
model in Prob . 4.1-5 . Follow the instructions of Prob . 4.2-1 for parts ( a ) , ( b ) ,
and ( c ) ...
Page 289
Consider the model of Prob . 6.7-1 . Use duality theory directly to determine
whether the current basic solution remains optimal after each of the following
independent changes . ( a ) The change in part ( e ) of Prob . 6.7-1 ( b ) The
change in ...
Consider the model of Prob . 6.7-1 . Use duality theory directly to determine
whether the current basic solution remains optimal after each of the following
independent changes . ( a ) The change in part ( e ) of Prob . 6.7-1 ( b ) The
change in ...
Page 397
Reconsider Prob . 8.1-4 . Starting with the northwest corner rule , interactively
apply the transportation simplex method to obtain an optimal solution for this
problem . DI 8.2-16 . Reconsider Prob . 8.1-6 . Starting with Russell's
approximation ...
Reconsider Prob . 8.1-4 . Starting with the northwest corner rule , interactively
apply the transportation simplex method to obtain an optimal solution for this
problem . DI 8.2-16 . Reconsider Prob . 8.1-6 . Starting with Russell's
approximation ...
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 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 |