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 89
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 370
16 , the first allocation is xu = 30 , which exactly uses up the demand in column 1
( and eliminates this column from further consideration ) . This first iteration
leaves a supply of 20 remaining in row 1 , so next select X1 , 1 + 1 = x12 to be a
basic ...
16 , the first allocation is xu = 30 , which exactly uses up the demand in column 1
( and eliminates this column from further consideration ) . This first iteration
leaves a supply of 20 remaining in row 1 , so next select X1 , 1 + 1 = x12 to be a
basic ...
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 ...
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 | |
57 other sections not shown
Other editions - View all
Common terms and phrases
activity additional algorithm allocation allowable amount apply assignment basic solution basic variable BF solution bound boundary calculations called capacity changes coefficients column complete Consider constraints construct corresponding cost CPF solution demand described determine direction distribution dual problem entering equal equations estimates example feasible FIGURE final flow problem Formulate 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 resource respective resulting revised Select shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit values weeks Wyndor Glass zero
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 |