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 29
Page 732
Frederick S. Hillier, Gerald J. Lieberman. The end product of this line of
reasoning is that each player should play in such a way as to minimize his
maximum losses whenever the resulting choice of strategy cannot be exploited
by the opponent ...
Frederick S. Hillier, Gerald J. Lieberman. The end product of this line of
reasoning is that each player should play in such a way as to minimize his
maximum losses whenever the resulting choice of strategy cannot be exploited
by the opponent ...
Page 734
To illustrate, suppose that players l and 2 in variation 3 of the political campaign
problem (see Table 14.5) select the mixed strategies (x1,x2, X3) = (5, 5, 0) and on
yz, y3) = (0, §, §), respectively. This selection would say that player l is giving all ...
To illustrate, suppose that players l and 2 in variation 3 of the political campaign
problem (see Table 14.5) select the mixed strategies (x1,x2, X3) = (5, 5, 0) and on
yz, y3) = (0, §, §), respectively. This selection would say that player l is giving all ...
Page 744
Consider the following parlor game to be played between two players. Each
player begins with three chips: one red, one white, and one blue. Each chip can
be used only once. To begin, each player selects one of her chips and places it
on ...
Consider the following parlor game to be played between two players. Each
player begins with three chips: one red, one white, and one blue. Each chip can
be used only once. To begin, each player selects one of her chips and places it
on ...
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 |