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

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?


Determine an initial basic feasible solution of the following transportation problem by north west corner method.

  Bangalore Nasik Bhopal Delhi Capacity
Chennai 6 8 8 5 30
Madurai 5 11 9 7 40
Trickly 8 9 7 13 50
Demand
(Units/day)
35 28 32 25  

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  

Determine basic feasible solution to the following transportation problem using North west Corner rule.

    Sinks  
    A B C D E Supply
  P 2 11 10 3 7 4
Origins Q 1 4 7 2 1 8
  R 3 9 4 8 12 9
Demand   3 3 4 5 6  

Obtain an initial basic feasible solution to the following transportation problem by north west corner method.

  D E F C Available
A 11 13 17 14 250
B 16 18 14 10 300
C 21 24 13 10 400
Required 200 225 275 250  

Choose the correct alternative:

In a non – degenerate solution number of allocation is


Choose the correct alternative:

In a degenerate solution number of allocations is


Choose the correct alternative:

The Penalty in VAM represents difference between the first ______


The following table summarizes the supply, demand and cost information for four factors S1, S2, S3, S4 Shipping goods to three warehouses D1, D2, D3.

  D1 D2 D3 Supply
S1 2 7 14 5
S2 3 3 1 8
S3 5 4 7 7
S4 1 6 2 14
Demand 7 9 18  

Find an initial solution by using north west corner rule. What is the total cost for this solution?


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×