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 79
Page 97
Plants 1 , 2 , and 3 have the excess capacity to produce A at the beginning of a
year returns $ 1.40 ( a profit of $ 0.40 ) 2 750 , 900 , and 450 units per day of this
product , respectively , reyears later ( in time for immediate reinvestment ) .
Plants 1 , 2 , and 3 have the excess capacity to produce A at the beginning of a
year returns $ 1.40 ( a profit of $ 0.40 ) 2 750 , 900 , and 450 units per day of this
product , respectively , reyears later ( in time for immediate reinvestment ) .
Page 393
The labor cost per hour in producing oats is $ 6.90 , $ 7.50 , and $ 6.30 in
England , France , and Spain , respectively . The problem is to allocate land use
in each country so as to meet the world food requirement and minimize the total
labor ...
The labor cost per hour in producing oats is $ 6.90 , $ 7.50 , and $ 6.30 in
England , France , and Spain , respectively . The problem is to allocate land use
in each country so as to meet the world food requirement and minimize the total
labor ...
Page 617
Before , the binary variable was fixed at 0 and 1 , respectively , for the two new
subproblems . Now , the general integer - restricted variable could have a very
large number of possible integer values , and it would be inefficient to create and
...
Before , the binary variable was fixed at 0 and 1 , respectively , for the two new
subproblems . Now , the general integer - restricted variable could have a very
large number of possible integer values , and it would be inefficient to create and
...
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 |