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

Page 539

In general , the states are the various

In general , the states are the various

**possible**conditions in which the system might be at that stage of the problem . The number of states may be either finite ( as in the stagecoach problem ) or infinite ( as in some subsequent ...Page 556

We now have an infinite number of

We now have an infinite number of

**possible**states ( 240 SS3 255 ) , so it is no longer feasible to solve separately for x for each**possible**value of sz . Therefore , we instead have solved for it as a function of the unknown Sz . Using ...Page 560

It only means that , instead of considering all

It only means that , instead of considering all

**possible**values of the one state variable , we must consider all**possible**combinations of values of the several state variables . However , from the standpoint of computational efficiency ...### 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 allowable amount apply assignment basic solution basic variable BF solution bound boundary called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution decision variables demand described determine distribution dual problem entering equal equations estimates example feasible feasible region FIGURE final flow formulation functional constraints given gives goal identify illustrate increase indicates initial iteration linear programming Maximize million Minimize month needed node nonbasic variables objective function obtained operations optimal optimal solution original parameters path Plant possible presented primal problem Prob procedure profit programming problem provides range remaining resource respective resulting shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit weeks Wyndor Glass zero