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 88
Page 369
To begin , all source rows and destination columns of the transportation simplex tableau are initially under ... Eliminate that row or column ( whichever had the smaller remaining supply or demand ) from further consideration .
To begin , all source rows and destination columns of the transportation simplex tableau are initially under ... Eliminate that row or column ( whichever had the smaller remaining supply or demand ) from further consideration .
Page 371
At each iteration , after the difference for every row and column remaining under consideration is calculated and displayed , the largest difference is circled and the smallest unit cost in its row or column is enclosed in a box .
At each iteration , after the difference for every row and column remaining under consideration is calculated and displayed , the largest difference is circled and the smallest unit cost in its row or column is enclosed in a box .
Page 413
Now let us relate these columns directly to the outline given for the algorithm . The input for nth iteration is provided by the fifth and sixth columns for the preceding iterations , where the solved nodes in the fifth column are then ...
Now let us relate these columns directly to the outline given for the algorithm . The input for nth iteration is provided by the fifth and sixth columns for the preceding iterations , where the solved nodes in the fifth column are then ...
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