Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Table
Table6S3b
6S3b Allocate
Allocate150
150Units
UnitstotoCell
CellB2
B2
Table 6S4 200 Units Are Assigned to Cell
C3 and 50 Units Are
Assigned to cell A1
Table
Table6S5
6S5 Completion
Completionofofthe
theInitial
InitialFeasible
FeasibleSolution
Solutionfor
forthe
theHarley
Harley
Problem
ProblemUsing
UsingthetheIntuitive
IntuitiveApproach
Approach
Table 6S6Vogels
Approximation Initial
Allocation Tableau with
Penalty Costs
Table 6S7Initial Feasible
Solution Obtained Using the
Northwest-Corner Method
Table
Table6S8
6S8 Evaluation
EvaluationPath
Pathfor
forCell
CellB1
B1
Table 6S9 Evaluation Path for
Cell C1
Table
Table6S10
6S10 Evaluation
EvaluationPaths
Pathsfor
forCells
CellsA3
A3and
andC2
C2
Table 6S11 Initial Feasible
Solution Obtained Using the
Northwest-Corner Method
Table
Table6S14
6S14 Stepping-Stone
Stepping-StonePath
Pathfor
forCell
CellA3
A3
Table 6S15 Distribution Plan
after Reallocation of 50 Units
Table
Table6S16
6S16 Index
IndexNumbers
Numbersand
andCell
CellEvaluations
Evaluations
Summary of the Transportation
Method
1. Obtain an initial feasible solution. Use either the northwest-corner
method, the intuitive method, or the Vogels approximation
method. Generally, the intuitive method and Vogels approximation
are the preferred approaches.
2. Evaluate the solution to determine if it is optimal. Use either the
stepping-stone method or MODI. The solution is not optimal if any
unoccupied cell has a negative cell evaluation.
3. If the solution is not optimal, select the cell that has the most
negative cell evaluation. Obtain an improved solution using the
stepping-stone method.
4. Repeat steps 2 and 3 until no cell evaluations (reduced costs) are
negative. Once you have identified the optimal solution, compute
its total cost.
Special Issues
Table
Table6S17b
6S17b Alternate
AlternateOptimal
OptimalSolution
Solution
Table 6S18 Harley Alternate
Solution Modified for
Degeneracy
Table
Table6S19
6S19 Solution
SolutiontotoHarley
HarleyProblem
Problemwith
withaaProhibited
ProhibitedRoute
Route
Table 6S20 A Dummy Origin Is
Added to Make Up 80 Units
Table
Table6S21
6S21 Solution
SolutionUsing
Usingthe
theDummy
DummyOrigin
Origin
Table 6S21 Solution Using the
Dummy Origin
Table
Table6S22
6S22 Solution
SolutionUsing
Usingthe
theDummy
DummyOrigin
Origin
Table 6S23 Row Reduction
Special Situations
Certain situations can arise in which the
model deviates slightly from that
previously described.
Among those situations are the following:
The number of rows does not equal the
number of columns.
The problem involves maximization rather
than minimization.
Certain matches are undesirable or not
allowed.
Multiple optimal solutions exist.
Table 6S24 Column Reduction of
Opportunity (Row Reduction) Costs
Table 6S25 Determine the Minimum
Number of Lines Needed to Cover
the Zeros
Table
Table6S26
6S26 Further
FurtherRevision
Revisionofofthe
theCost
CostTable
Table
Table 6S27 Optimal
Assignments