Chapter 6.

Linear Programming

LINEAR PROGRAMMING
Linear programming (LP) techniques consist of a sequence of steps that wi l lead to an optimal
solution to linear-constrained problems, if an optimal solution exists. There are a number of
different linear programming techniques; some are special-purpose (i.e., used to find solutions
for specific types of problems) and others are more general in scope. This chapter covers the two
general-purpose solution techniques: graphical linear programming and computer solutions.
Graphical linear programming provides a visual portrayal of many of the important concepts of
linear programming. However, it is limited to problems with only two variables. In practice,
computers are used to obtain solutions for problems, some of which involve a large number of
variables.

Transportation method is a linear programming problem that help in distributing goods

from on location to another at a lower cost.
The U.V method is formerly known as MODI or modification

approach two methods in transportation problem

I. Finding the initial basic feasible solution in the first phase.

II. Second phase involve optimization of the initial basic feasible solution which is
obtained in phase I.

Finding the initial basic solution

1. Northwest corner cell method

2. Least cost method
3. Vogel’s Approximation Method (VAM)

Optimizing the basic feasible solution applying the U.V method

Problem. Find the initial basic feasible solution of the following transportation problem by
northwest corner cell and optimized the solution using the U.V method.

Optimizing the basic feasible solution applying the U.V method

Problem. Find the initial basic feasible solution of the following transportation problem by
northwest corner cell and optimized the solution using the U.V method.
 DESTINATION

1 2 3 4 Supply
200 50

S
O 1 3 1 7 4 250 (50) (0)
U
R 250 100
C 350 100 (0)
E 2 2 6 5 9
S
250 150
400 150 (0)
3 8 3 3 2
Demand 200 300 350 150
(0) 250 250 (0)
(0) (0)

Total: 200X3 + 50 x 1 + 250 x 6 + 100 X 5 + 250 x3 + 150 x 2 = 3,700

Applying the U.V method
Formula: U.V = 𝑉𝑖 + 𝑉𝑗 = 𝐶𝑖𝑗

Rule. Check how many occupied cells following the formula R + C = 6. If the row and column
have the total occupied cell required, proceed to U.V method.

V1= 3 V2 = 1 V3= 0 V4= -1

250
U1= 0

3- +1 7 4
200 50 100
U2 = 5 (+) -
2 6 5 9
250 150
U3 = 3
8 3 3 2

1. Determine the U and V values using the formula: U.V = 𝑉𝑖 + 𝑉𝑗 = 𝐶𝑖𝑗

C13 = 0 + 0 -7 = -7
C14 = 0 -1 -4 = -5
 C21= 5+ 3 -2 = 6
C24= 5 -1 -9 = -5
C31= 3 + 3 -8 = -2
C32= 3 + -3 = 1

Here, since there are 2 positive values and we are trying to find all negative values, determine the highest
positive value and make a close loop.

Rule. Check the positive and negative values; for the positive values, subtract which one is less and add
the difference to the positive values. Those values not affected by the close loop will be copied as it is in
the next table. Then find the U.V values

V1= -3 V2 = 1 V3= 0 V4= -1

250
U1= 0

3 1 7 4
200 50 100
U2 = 5
2 6 5 9
250 150
U3 = 3
8 3 3 2
Check the cell penalty

C11 = 0 -3 -3 = -6
C13 = 0-0-7 = -7
C14 = 0-1-4 = -5
C24 = 5-1-9 = -5
C31 = 3-3-8 = -8
C32 = 3+1-3 = 1
Since there is one more positive value, we need to find the close loop.

V1= V2 = V3= V4=

250
U1= 0

3 1 7 4
200 50 100
- +
U2 =
2 6 5 9
250 150
U3 =
8 + - 3 2
3

V1= -2 V2=1 V3 = 1 V4=0

250
U1= 0

3 1 7 4
200 150
U2 = 4
2 6 5 9
50 200 150
U3 = 2
8 3 3 2

Ce l evaluation
C11= 0 -2 -3 = -5
C13= 0+1-7 = -8
C14= 0+0-4 = -4
C22= 4+1-6 = -1
C24= 4+0-9 = -5
C31= 2-2-8 - -8

Calculate the total cost250x1 + 200x2 + 150zx5 + 50x3 + 200x3 + 150x2 = 2,900 3,700 – 2,900 = 800
 2. LEAST COST METHOD

To
1 2 3 4 Supply
150
150 (0)

F
A A 6 2 14 8
C
125 25 50
T 200 (75)
O
R B 4 12 10 18
Y 150 100
250 (150)

C 16 6 6 4

Demand 125 175 200 100

(0) (25) 0 (0)

Total cost: 150x2 + 125x4 + 25x12 + 50x10 + 150x6 + 100x4 = 2,900

VOGLES APPROXIMATION METHOD

Rule

1. Find the row and column difference by subtracting the least value and the second least value.
2. Determine which one is the highest value among all the row and column difference and
assigned load by finding which one is least between demand and supply.
3. Repeat the process
4. Determine the total cost.
 DESTINATION

A B C D Supply Row
Difference

S
O 1 3 1 7 4 300
U
R
C 400
E 2 2 6 5 9
S

500
3 8 3 3 2
Demand 250 350 400 200
Col. difference