## 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 41

Page 732

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

so ...

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 to then improve his position . Thisso ...

Page 734

vice to obtain a random observation from the probability distribution specified by

the mixed

campaign problem ( see Table 14.5 ) select the mixed

vice to obtain a random observation from the probability distribution specified by

the mixed

**strategy**, where this ... that players 1 and 2 in variation 3 of the politicalcampaign problem ( see Table 14.5 ) select the mixed

**strategies**( X1 , X2 , X3 ) ...Page 735

Although the concept of mixed

played repeatedly , it requires some interpretation when the game is to be played

just once . In this case , using a mixed

Although the concept of mixed

**strategies**becomes quite intuitive if the game isplayed repeatedly , it requires some interpretation when the game is to be played

just once . In this case , using a mixed

**strategy**still involves selecting and using ...### 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 alternative amount analysis apply assignment assumed basic variable begin BF solution calculate called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution customers decision demand described determine developed distribution entering equations estimated example expected feasible FIGURE final flow formulation given gives hour identify illustrate increase indicates initial inventory iteration linear programming machine Maximize mean million Minimize month needed node objective function obtained operations optimal optimal solution original parameter path payoff 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