English
Tamil Nadu Board of Secondary EducationHSC Commerce Class 12

Explain Vogel’s approximation method by obtaining initial feasible solution of the following transportation problem. D1 D2 D3 D4 Supply O1 2 3 11 7 6 O2 1 0 6 1 1 O3 5 8 15 9 10 Demand 7 5 3 2 - Business Mathematics and Statistics

Advertisements
Advertisements

Question

Explain Vogel’s approximation method by obtaining initial feasible solution of the following transportation problem.

  D1 D2 D3 D4 Supply
O1 2 3 11 7 6
O2 1 0 6 1 1
O3 5 8 15 9 10
Demand 7 5 3 2  
Chart
Sum
Advertisements

Solution

Let ‘ai‘ denote the supply and ‘bj‘ denote the demand `sum"a"_"i"` = 6 + 1 + 10 = 17 and `sum"b"_"j"` = 7 + 5 + 3 + 2 = 17

`sum"a"_"i" = sum"b"_"j"`

i.e Total supply = Total demand.

The given problem is a balanced transportation problem. Hence there exists a feasible solution to the given problem.

First, we 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.

First allocation:

  D1 D2 D3 D4 (ai) Penalty
O1 2 3 11 7 6 (1)
O2 1 0 6 (1)1 1/10 (1)
O3 5 8 15 9 10 (3)
(bj) 7 5 3 2/1    
Penalty (1) (3) (5) (6)    

The largest difference is 6 corresponding to column D4.

In this column least cost is (O2, D4).

Allocate min (2, 1) to this cell.

Second allocation:

  D1 D2 D3 D4 (ai) Penalty
O1 2 (5)3 11 7 6/1 (1)
O3 5 8 15 9 10 (3)
(bj) 7 5/0 3 2/1    
Penalty (3) (5) (4) (2)    

The largest difference is 5 in column D2.

Here the least cost is (O1, D2).

So allocate min (5, 6) to this cell.

Third allocation:

  D1 D3 D4 (ai) Penalty
O1 (1)2 11 7 1/0 (5)
O3 5 15 9 10 (4)
(bj) 7/6 3 1    
Penalty (3) (4) (2)    

The largest penalty is 5 in row O1.

The least cost is in (O1, D1).

So allocate min (7, 1) here.

Fourth allocation:

  D1 D3 D4 (ai) Penalty
O3 (6)5 15 9 10/4 (4)
(bj) 6/0 3 1    
Penalty    

Fifth allocation:

  D3 D4 (ai) Penalty
O3 (3)15 (1)9 4/3/0 (6)
(bj) 3/0 1/0    
Penalty    

We allocate min (1, 4) to (O3, D4) cell since it has the least cost.

Finally the balance we allot to cell (O3, D3).

Thus we have the following allocations:

  D1 D2 D3 D4 (ai)
O1 (1)2 (5)3 11 7 6
O2 1 0 6 (1)1 1
O3 (6)5 8 (3)15 (1)9 10
(bj) 7 5 3 2  

Transportation schedule:

O1 → D1

O1 → D2

O2 → D4

O3 → D1

O3 → D3

O3 → D4

i.e x11 = 12

x12 = 5,

x24 = 1

x31 = 6

x33 = 3

x34 = 1

Total cost = (1 × 2) + (5 × 3) + (1 × 1) + (6 × 5) + (3 × 15) + (1 × 9)

= 2 + 15 + 1 + 30 + 45 + 9

= 102

shaalaa.com
Transportation Problem
  Is there an error in this question or solution?
Chapter 10: Operations Research - Exercise 10.1 [Page 250]

APPEARS IN

Samacheer Kalvi Business Mathematics and Statistics [English] Class 12 TN Board
Chapter 10 Operations Research
Exercise 10.1 | Q 8 | Page 250

RELATED QUESTIONS

What is transportation problem?


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

  D1 D2 D3 Supply
O1 9 8 5 25
O2 6 8 4 35
O3 7 6 9 40
Demand 30 25 45  

Consider the following transportation problem.

  D1 D2 D3 D4 Availability
O1 5 8 3 6 30
O2 4 5 7 4 50
O3 6 2 4 6 20
Requirement 30 40 20 10  

Determine initial basic feasible solution by VAM.


Find the initial basic feasible solution of the following transportation problem:

  I II III Demand
A 1 2 6 7
B 0 4 2 12
C 3 1 5 11
Supply 10 10 10  

Using North West Corner rule


Find the initial basic feasible solution of the following transportation problem:

  I II III Demand
A 1 2 6 7
B 0 4 2 12
C 3 1 5 11
Supply 10 10 10  

Using Least Cost method


Find the initial basic feasible solution of the following transportation problem:

  I II III Demand
A 1 2 6 7
B 0 4 2 12
C 3 1 5 11
Supply 10 10 10  

Using Vogel’s approximation method


Consider the following transportation problem

  Detination Availabiity
  D1 D2 D3 D4  
O1 5 8 3 6 30
O2 4 5 7 4 50
O3 6 2 4 6 20
Requirement 30 40 20 10  

Determine an initial basic feasible solution using Least cost method


Consider the following transportation problem

  Destination Availability
  D1 D2 D3 D4  
O1 5 8 3 6 30
O2 4 5 7 4 50
O3 6 2 4 6 20
Requirement 30 40 20 10  

Determine an initial basic feasible solution using Vogel’s approximation method


Determine an initial basic feasible solution to the following transportation problem by using north west corner rule

    Destination Supply
    D1 D2 D3  
  S1 9 8 5 25
Source S2 6 8 4 35
  S3 7 6 9 40
  Requirement 30 25 45  

Determine an initial basic feasible solution to the following transportation problem by using least cost method

    Destination Supply
    D1 D2 D3  
  S1 9 8 5 25
Source S2 6 8 4 35
  S3 7 6 9 40
  Requirement 30 25 45  

Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×