Introduction to Operations ResearchCD-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 87
Page 369
To begin, all source rows and destination columns of the transportation simplex
tableau are initially under consideration for ... 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 consideration for ... 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. The resulting ...
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. The resulting ...
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 listed in the ...
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 listed in the ...
What people are saying - Write a review
User Review - Flag as inappropriate
i
User Review - Flag as inappropriate
I want review this book
Contents
SUPPLEMENT TO APPENDIX 3 | 3 |
Problems | 6 |
An Algorithm for the Assignment Problem | 18 |
Copyright | |
44 other sections not shown
Other editions - View all
Common terms and phrases
activity additional algorithm alternative amount analysis apply assigned assumed basic variable begin BF solution bound calculate called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution customers decision demand described determine developed distribution entering equations estimated example expected feasible FIGURE final flow formulation given gives hour identify illustrate increase indicates initial inventory iteration linear programming machine Maximize maximum mean million Minimize month needed node objective function obtained operations optimal optimal solution original parameter path payoff perform plant player possible presented Prob probability problem procedure profit programming problem queueing respectively resulting shown shows side simplex method solution solve step strategy Table tableau tion transportation unit weeks
Bibliographic information
| Title | Introduction to Operations Research McGraw-Hill International Editions McGraw-Hill industrial & plant engineering series McGraw-Hill series in industrial engineering and management science |
| Authors | Frederick S. Hillier, Gerald J. Lieberman |
| Edition | 7, illustrated |
| Publisher | McGraw-Hill, 2001 |
| Original from | Pennsylvania State University |
| Digitized | 26 Aug 2009 |
| ISBN | 0071181636, 9780071181631 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |