Introduction to Operations Research, Volume 1CD-ROM contains: Student version of MPL Modeling System and its solver CPLEX -- MPL tutorial -- Examples from the text modeled in MPL -- Examples from the text modeled in LINGO/LINDO -- Tutorial software -- Excel add-ins: TreePlan, SensIt, RiskSim, and Premium Solver -- Excel spreadsheet formulations and templates. |
From inside the book
Results 1-3 of 82
Page 60
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 .
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 ) : Amount produced + inventory last month + amount shipped in = sales + current inventory + amount shipped out , where the amount produced is ...
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 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 ...
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
Introduction to Operations Research Frederick S. Hillier,Gerald J. Lieberman No preview available - 2001 |
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 direction 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