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 80
Page 164
Now let us look at the key idea behind Karmarkar's algorithm and its subsequent
variants that use the interior-point approach. The Key Solution Concept Although
radically different from the simplex method, Karmarkar's algorithm does share a ...
Now let us look at the key idea behind Karmarkar's algorithm and its subsequent
variants that use the interior-point approach. The Key Solution Concept Although
radically different from the simplex method, Karmarkar's algorithm does share a ...
Page 616
12.7 easier to fathom with this new fathoming test (in either form), so the
algorithm should run much faster. For a large problem, this acceleration may
make the difference between finishing with a solution guaranteed to be close to
optimal and ...
12.7 easier to fathom with this new fathoming test (in either form), so the
algorithm should run much faster. For a large problem, this acceleration may
make the difference between finishing with a solution guaranteed to be close to
optimal and ...
Page 640
(a) Design a branch-and-bound algorithm for sequencing problems of this type
by specifying how the branch, bound, and fathoming steps would be performed. (
b) Use this algorithm to solve this problem. 12.6-9.” Consider the following ...
(a) Design a branch-and-bound algorithm for sequencing problems of this type
by specifying how the branch, bound, and fathoming steps would be performed. (
b) Use this algorithm to solve this problem. 12.6-9.” Consider the following ...
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 |