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 100
Page 200
Now consider the basic feasible solutions. Note that the only requirements for a
solution to be feasible in the augmented form of the problem are that it satisfy the
system of equations and that all the variables be nonnegative. A BF solution is a
...
Now consider the basic feasible solutions. Note that the only requirements for a
solution to be feasible in the augmented form of the problem are that it satisfy the
system of equations and that all the variables be nonnegative. A BF solution is a
...
Page 397
D.l (b) Use the northwest corner rule to obtain an initial BF solution for this
problem. DJ (c) Starting with the initial BF solution from part (b), interactively
apply the transportation simplex method to obtain an optimal solution. D.l (d) Use
Vogel's ...
D.l (b) Use the northwest corner rule to obtain an initial BF solution for this
problem. DJ (c) Starting with the initial BF solution from part (b), interactively
apply the transportation simplex method to obtain an optimal solution. D.l (d) Use
Vogel's ...
Page 457
(b) Use the optimality test to verify that this initial BF solution is optimal and that
there are multiple optimal solutions. Apply one iteration of the network simplex
method to find the other optimal BF solution, and then use these results to identify
...
(b) Use the optimality test to verify that this initial BF solution is optimal and that
there are multiple optimal solutions. Apply one iteration of the network simplex
method to find the other optimal BF solution, and then use these results to identify
...
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 |