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 algebraic algorithm allocation allowable range artificial variables assignment problem augmenting path basic solution Big M method changes coefficients column Consider the following constraint boundary corresponding CPLEX decision variables dual problem dynamic programming entering basic variable example feasible region feasible solutions final simplex tableau final tableau following problem formulation functional constraints Gaussian elimination given goal goal programming graphically identify increase initial BF solution integer interior-point iteration leaving basic variable linear programming model linear programming problem LP relaxation lution Maximize Maximize Z maximum flow problem Minimize needed node nonbasic variables objective function obtained optimal solution optimality test path Plant presented in Sec primal problem Prob procedure range to stay resource right-hand sides sensitivity analysis shadow prices slack variables solve this model Solver spreadsheet step subproblem surplus variables tion transportation problem transportation simplex method weeks Wyndor Glass x₁ zero