L14_10 - ESI 6314 Deterministic Methods in Operations...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
1/24 ESI 6314 Deterministic Methods in Operations Research Lecture Notes University of Florida Department of Industrial and Systems Engineering / REEF
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2/24 The transportation simplex method Previously, we have considered three different methods for finding a bfs for a transportation problem: 1 Northwest Corner (NWC) method 2 Minimum Cost (MC) method 3 Vogel’s method Recall that in these methods we use the fact that in a balanced transportation problem we may omit any of the m + n constraints, since it will be automatically satisfied if all the remaining constraints are satisfied. We may arbitrarily assume that that the constraint that we drop is the first supply constraint. As a result, we have m + n - 1 constraints and, therefore, m + n - 1 basic variables. How do we know if a given set of m + n - 1 variables can form a basis?
Background image of page 2
3/24 The transportation simplex method The matrix B must be nonsingular! To easily test whether B is nonsingular and thus the corresponding variables of the transportation problem can form a bfs, we will use the concept of a loop defined for the transportation table. Definition An ordered sequence of at least four different cells is called a loop if 1 Any two consecutive cells lie in either the same row or same column 2 No three consecutive cells lie in the same row or column 3 The last cell in the sequence has a row or column in common with the first cell in the sequence
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4/24 The transportation simplex method Theorem In a balanced transportation problem with m supply points and n demand points, the cells corresponding to a set of m + n - 1 variables contain no loop if and only if the m + n - 1 variables yield a bfs.
Background image of page 4
5/24 The transportation simplex method Based on the transportation tableau, the following steps should be performed. 1 Determine (by a criterion to be developed shortly) the variable that should enter the basis. 2 Find the loop (it can be shown that there is only one loop) involving the entering variable and some of the basic variables. 3 Counting the cells in the loop (starting with 0 corresponding to the entering variable), label them as even cells or odd cells. 4 Find an odd cell whose variable assumes the smallest value θ .
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 24

L14_10 - ESI 6314 Deterministic Methods in Operations...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online