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 85
Page 370
Because this supply is no larger than the demand of 20 in column 2, all of it is
allocated, x,2 = 20, and this row is eliminated from further consideration. (Row l is
chosen for elimination rather than column 2 because of the parenthetical ...
Because this supply is no larger than the demand of 20 in column 2, all of it is
allocated, x,2 = 20, and this row is eliminated from further consideration. (Row l is
chosen for elimination rather than column 2 because of the parenthetical ...
Page 371
At each iteration, after the difference for every row and column remaining under
consideration is calculated and displayed, the largest difference is circled and the
smallest unit cost in its row or column is enclosed in a box. The resulting ...
At each iteration, after the difference for every row and column remaining under
consideration is calculated and displayed, the largest difference is circled and the
smallest unit cost in its row or column is enclosed in a box. The resulting ...
Page 413
Now let us relate these columns directly to the outline given for the algorithm. The
input for nth iteration is provided by the fifth and sixth columns for the preceding
iterations, where the solved nodes in the fifth column are then listed in the ...
Now let us relate these columns directly to the outline given for the algorithm. The
input for nth iteration is provided by the fifth and sixth columns for the preceding
iterations, where the solved nodes in the fifth column are then listed in the ...
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 |