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 72
Typically, it will indicate that it has found an optimal solution, as specified in the
Solver Results dialogue box shown in Fig. 3.19 ... The spreadsheet also indicates
the value of the objective function, as well as the amount of each resource that is
...
Typically, it will indicate that it has found an optimal solution, as specified in the
Solver Results dialogue box shown in Fig. 3.19 ... The spreadsheet also indicates
the value of the objective function, as well as the amount of each resource that is
...
Page 199
Each constraint has an indicating variable that completely indicates (by whether
its value is zero) whether that constraint's boundary equation is satisfied by the
current solution. A summary appears in Table 5.3. For the type of constraint in ...
Each constraint has an indicating variable that completely indicates (by whether
its value is zero) whether that constraint's boundary equation is satisfied by the
current solution. A summary appears in Table 5.3. For the type of constraint in ...
Page 450
An asterisk on the problem number indicates that at least a partial answer is
given in the back of the book. 9.2-1. Consider the following directed network. (a)
Find a directed path from node A to node F, and then identify three other
undirected ...
An asterisk on the problem number indicates that at least a partial answer is
given in the back of the book. 9.2-1. Consider the following directed network. (a)
Find a directed path from node A to node F, and then identify three other
undirected ...
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 |