Method:1 North-West Corner Rule (NWC), Method:2 Least Cost Method (LCM), Method:3 Vogelâ€™s Approximation Method(VAM)

**Methods
of finding initial Basic Feasible Solutions**

There are several
methods available to obtain an initial basic feasible solution of a
transportation problem. We discuss here only the following three. For finding
the initial basic feasible solution total supply must be equal to total demand.

It is a simple method to
obtain an initial basic feasible solution. Various steps involved in this
method are summarized below.

**Step 1: **Choose the cell in the
north- west corner of the transportation Table10.1 and allocate** **as much
as possible in this cell so that either the capacity of first row (supply)is
exhausted or the destination requirement of the first column(demand) is
exhausted. (i.e) *x _{11}* = min(

**Step 2: **If the demand is
exhausted (*b*_{1}** **<** ***a*_{1}), move
one cell right horizontally tothe second** **column and allocate as much as
possible.(i.e) *x _{12}*= min (

If the supply is
exhausted (*b*_{1} > *a*_{1}), move one cell down
vertically to the second row and allocateas much as possible.(i.e)*x*_{21}
= min (*a*_{2},*b*_{1} â€“ *x*_{11})

If both supply and
demand are exhausted move one cell diagonally and allocate as much as possible.

**Step 3: **Continue the above
procedure until all the allocations are made

**Example
10.1**

Obtain the initial
solution for the following problem

*Solution:*

Here total supply =
5+8+7+14=34, Total demand = 7+9+18=34

(i.e) Total supply
=Total demandâˆ´The given problem is balanced transportation problem.

âˆ´
we can findan initial basic feasible solution to the given problem.

From the above table we
can choose the cell in the North West Corner. Here the cell is (1,A)

Allocate as much as
possible in this cell so that either the capacity of first row is exhausted or
the destination requirement of the first column is exhausted.

i.e. x_{11} =
min (5,7) = 5

Reduced transportation
table is

Now the cell in the North west corner is (2, A)

Allocate as much as
possible in the first cell so that either the capacity of second row is
exhausted or the destination requirement of the first column is exhausted.

i.e. x_{12} =
min (2,8) = 2

Reduced transportation
table is

Here north west corner
cell is (2,B) Allocate as much as possible in the first cell so that either the
capacity of second row is exhausted or the destination requirement of the
second column is exhausted.

i.e. x_{22} =
min (6,9) = 6

Reduced transportation
table is

Here north west corner
cell is (3,B).

Allocate as much as
possible in the first cell so that either the capacity of third row is
exhausted or the destination requirement of the second column is exhausted.

i.e. x_{32} =
min (7,3) = 3

Reduced transportation
table is

Here north west corner
cell is (3,C) Allocate as much as possible in the first cell so that either the
capacity of third row is exhausted or the destination requirement of the third
column is exhausted.

i.e. x_{33} =
min (4,18) = 4

Reduced transportation
table and final allocation is x_{44} = 14

Thus we have the
following allocations

Transportation schedule
: 1â†’ A, 2â†’A, 2â†’B, 3â†’B, 3â†’C, 4â†’C

The total transportation
cost.

= (5 Ã— 2) + (2 Ã— 3) +(6
Ã— 3)+(3 Ã— 4)+(4 Ã— 7) + (14 Ã— 2)

= Rs.102

**Example
10.2**

Determine an initial
basic feasible solution to the following transportation problem using North
West corner rule.

Here O_{i} and D_{j}
represent i^{th} origin and j^{th} destination.

*Solution:*

Given transportation
table is

Total Availability =
Total Requirement

âˆ´
The given problem is balanced transportation problem.

Hence there exists a
feasible solution to the given problem.

**First allocation:**

**Second allocation:**

**Third Allocation: **

**Fourth Allocation: **

**Fifth allocation:**

**Final allocation: **

Transportation schedule
: O_{1}â†’ D_{1}, O_{1}â†’D_{2}, O_{2}â†’D_{2},
O_{2}â†’D_{3}, O_{3}â†’D_{3}, O_{3}â†’D_{3}.

The transportation cost

= (6 Ã— 6)+(8 Ã— 4)+(2 Ã—
9)+(14 Ã— 2)+(1 Ã— 6)+(4 Ã— 2) =Rs.128

The least cost method is
more economical than north-west corner rule,since it starts with a lower
beginning cost. Various steps involved in this method are summarized as under.

**Step 1**: Find the cell with the
least(minimum) cost in the** **transportation table.

**Step 2**: Allocate the maximum
feasible quantity to this cell.

**Step:3:** Eliminate the row or
column where an allocation is made.

**Step:4:** Repeat the above steps
for the reduced transportation table until all the allocations are made.

**Example
10.3**

Obtain an initial basic
feasible solution to the following transportation problem using least cost
method.

Here O_{i} and D_{j}
denote i^{th} origin and j^{th} destination respectively.

*Solution:*

Total Supply = Total
Demand = 24

âˆ´
The given problem is a balanced transportation problem.

Hence there exists a
feasible solution to the given problem.

Given Transportation
Problem is:

The least cost is 1
corresponds to the cells (O_{1}, D_{1}) and (O_{3}, D_{4})

Take the Cell (O_{1},
D_{1}) arbitrarily.

Allocatemin (6,4) = 4
units to this cell.

The reduced table is

The least cost
corresponds to the cell (O_{3}, D_{4}). Allocate min (10,6) = 6
units to this cell.

The reduced table is

The least costis 2
corresponds to the cells (O_{1}, D_{2}), (O_{2}, D_{3}),
(O_{3}, D_{2}), (O_{3}, D_{3})

Allocate min (2,6) = 2
units to this cell.

The reduced table is

The least cost is 2
corresponds to the cells (O_{2}, D_{3}), (O_{3}, D_{2}),
(O_{3}, D_{3})

Allocate min ( 8,8) = 8
units to this cell.

The reduced table is

Here allocate 4 units in
the cell (O_{3}, D_{2})

Thus we have the following
allocations:

Transportation schedule
:

O1â†’ D1, O1â†’D2, O2â†’D3,
O3â†’D2, O3â†’D4

Total transportation
cost

= (4Ã—1)+ (2Ã—2)+(8Ã—2)+(4Ã—2)+(6Ã—1)

= 4+4+16+8+6

=Rs. 38.

**Example
10.4**

Determine how much
quantity should be stepped from factory to various destinations for the
following transportation problem using the least cost method

Cost are expressed in
terms of rupees per unit shipped.

*Solution:*

Total Capacity = Total
Demand

âˆ´
The given problem is balanced transportation problem.

Hence there exists a
feasible solution to the given problem.

Given Transportation
Problem is

**First
Allocation:**

**Second Allocation:**

**Third Allocation:**

**Fourth Allocation:**

** Fifth Allocation:**

**Sixth Allocation:**

Transportation schedule
:

Tâ†’ H, Tâ†’P, Bâ†’C, Bâ†’H,
Mâ†’H, Mâ†’K

The total Transportation
cost = ( 5Ã—8) + (25Ã—5)+ (35Ã—5) + (5Ã—11)+ (18Ã—9) + (32Ã—7)

= 40+125+175+55+162+224

= â‚¹ 781

Vogelâ€™s approximation
method yields an initial basic feasible solution which is very close to the
optimum solution.Various steps involved in this method are summarized as under

**Step 1: **Calculate the penalties
for each row and each column. Here penalty means the** **difference between
the two successive least cost in a row and in a column .

**Step 2**: Select the row or
column with the largest penalty.

**Step 3**: In the selected row or
column, allocate the maximum feasible quantity to the cell** **with the
minimum cost.

**Step 4: **Eliminate the row or
column where all the allocations** **are made.

**Step 5: **Write the reduced
transportation table and repeat the** **steps 1 to 4.

**Step 6: **Repeat the procedure
until all the allocations are** **made.

**Example
10.5**

Find the initial basic
feasible solution for the following transportation problem by VAM

*Solution:*

Here âˆ‘a_{i} = âˆ‘b_{j}
= 950

(i.e) Total Availability
=Total Requirement

âˆ´The
given problem is balanced transportation problem.

Hence there exists a
feasible solution to the given problem.

First let us find the
difference (penalty) between the first two smallest costs in each row and
column and write them in brackets against the respective rows and columns

Choose the largest
difference. Here the difference is 5 which corresponds to column D_{1}
and D_{2}. Choose either D_{1} or D_{2} arbitrarily.
Here we take the column D_{1} . In this column choose the least cost.
Here the least cost corresponds to (S_{1}, D_{1}) . Allocate
min (250, 200) = 200units to this Cell.

The reduced
transportation table is

Choose the largest
difference. Here the difference is 5 which corresponds to column D_{2}.
In this column choose the least cost. Here the least cost corresponds to (S_{1},
D_{2}) . Allocate min(50,175) = 50 units to this Cell.

The reduced
transportation table is

Choose the largest
difference. Here the difference is 6 which corresponds to column D_{2}.
In this column choose the least cost. Here the least cost corresponds to (S_{2},
D_{2}) .

Allocate min(300,175) =
175 units to this cell.

The reduced
transportation table is

Choose the largest
difference. Here the difference is 4 corresponds to row S_{2}. In this
row choose the least cost. Here the least cost corresponds to (S_{2}, D_{4})
. Allocate min(125,250) = 125 units to this Cell.

The reduced transportation table is

The Allocation is

Thus we have the
following allocations:

Transportation schedule :

S_{1}â†’ D_{1},
S_{1}â†’D_{2}, S_{2}â†’D_{2}, S_{2}â†’D_{4},
S_{3}â†’D_{3}, S_{3}â†’D_{4}

This initial
transportation cost

= (200 Ã— 11) + (50 Ã—13)
+ (175 Ã— 18) + (125 Ã—10) + (275 Ã—13) + (125 Ã—10)

= â‚¹ 12,075

**Example
10.5**

Obtain an initial basic
feasible solution to the following transportation problem using Vogelâ€™s
approximation method.

*Solution:*

Here âˆ‘a_{i} = âˆ‘b_{j}
= 80 (i.e) Total Availability =Total Requirement

âˆ´The
given problem is balanced transportation problem.

Hence there exists a
feasible solution to the given problem.

**First Allocation: **

**Second Allocation: **

**Third Allocation:**

**Fourth Allocation:**

**Fifth Allocation:**

**Sixth Allocation:**

Thus we have the
following allocations:

Transportation schedule
:

Aâ†’ I, Aâ†’II, Aâ†’III, Aâ†’IV,
Bâ†’I, Câ†’IV, Dâ†’II

Total transportation
cost:

= ( 6 Ã— 5)+ ( 6 + 1)+ (17
Ã— 3)+ ( 5 Ã— 3)+ (15 Ã— 3) + (12 Ã— 3)+ (1 9 Ã—1)

= 30 + 6 + 51 + 15 + 45 +
36 + 19

= â‚¹ 202

Tags : Solved Example Problems | Transportation Problem | Operations Research , 12th Business Maths and Statistics : Chapter 10 : Operations Research

Study Material, Lecturing Notes, Assignment, Reference, Wiki description explanation, brief detail

12th Business Maths and Statistics : Chapter 10 : Operations Research : Methods of finding initial Basic Feasible Solutions | Solved Example Problems | Transportation Problem | Operations Research

**Related Topics **

Privacy Policy, Terms and Conditions, DMCA Policy and Compliant

Copyright Â© 2018-2024 BrainKart.com; All Rights Reserved. Developed by Therithal info, Chennai.