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

Page 60

Also shown next to F1 → F2 and DC → W2 are the maximum

Also shown next to F1 → F2 and DC → W2 are the maximum

**amounts**that can be shipped through these lanes . ... Net flow constraint for each location :**Amount**shipped out**amount**shipped in = required**amount**. As indicated in Fig .Page 75

1,000 plant balance constraints ( one for each combination of a plant , product , and month ) :

1,000 plant balance constraints ( one for each combination of a plant , product , and month ) :

**Amount**produced + inventory last month +**amount**shipped in = sales + current inventory +**amount**shipped out , where the**amount**produced is ...Page 106

Determine the

Determine the

**amount**of potatoes and green beans Maria should purchase each week given this new iron requirement . ( d ) Maria learns that the wholesaler has a surplus of green beans and is therefore selling the green beans for a lower ...### 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