Scribd
Upload
45 views7 pages

Operational Research Assignment: N o Name Index No Department 1 2 3 4

The document describes the transportation problem and provides definitions related to feasible solutions and optimal solutions. It then outlines the Vogel's Approximation Method (VAM) to obtain an initial basic feasible solution. This involves calculating row and column penalties and allocating quantities based on lowest costs. The method deletes rows or columns once full. Finally, it describes testing the initial solution for optimality using a theorem involving cell evaluations and determining if any are negative.

Uploaded by

Ashiq Nafas
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
45 views7 pages

Operational Research Assignment: N o Name Index No Department 1 2 3 4

The document describes the transportation problem and provides definitions related to feasible solutions and optimal solutions. It then outlines the Vogel's Approximation Method (VAM) to obtain an initial basic feasible solution. This involves calculating row and column penalties and allocating quantities based on lowest costs. The method deletes rows or columns once full. Finally, it describes testing the initial solution for optimality using a theorem involving cell evaluations and determining if any are negative.

Uploaded by

Ashiq Nafas
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Operational Research

Assignment

N Name Index No Department


o
1
2 M.N.M.A Nafas 070322C EE
3
4

Date of Submission : 04/04/2011


Introduction
Transportation problem

The transportation problem is one of the subclasses of LPPs in which the objective is to transport
various quantities of a single homogeneous commodity that are initially stored at various origins to
different destinations in such a way that the transportation cost is minimum. To achieve this objective
we must know the amount and location of available supplies and the quantities demanded. In addition
we must know the costs that result from transporting one unit of commodity from various origins to
various destinations.

Basic Definitions
Feasible Solution (F.S.)
A set of non-negative allocations xij ≥ 0 which satisfies the row and column restrictions is known as
feasible solution.
Basic Feasible Solution (B.F.S.)
A feasible solution to a m-origin and n-destination problem is said to be basic feasible solution if the
number of positive allocations are (m+n–1). If the number of allocations in a basic feasible solutions are
less than (m+n–1), it is called degenerate basic feasible solution (DBFS) (otherwise non-degenerate).
Optimal Solution
A feasible solution (not necessarily basic) is said to be optimal if it minimizes the total transportation
cost.
Methodology
In order to find the solution of this transportation problem we have to follow the steps given below.
(A) Initial basic feasible solution
(B) Test for optimization.

Initial Basic Feasible Solution


There are three different methods to obtain the initial basic feasible solution viz.
I. North-West corner rule
II. Lowest cost entry method
III. Vogel’s approximation method
In this question Vogel’s approximation method is used to solve the problem
Vogel's Approximation Method (VAM)
The steps involved in this method for finding the initial solution are as follows.
Step 1 Find the penalty cost, naively the difference between the smallest and next smallest costs in
each row and column.
Step 2 Among the penalties as found in step(l) choose the maximum penalty. If this maximum
penalty is more than one (i.e if there is a tie) choose any one arbitrarily.
Step 3 In the selected row or column as by step(2) find out the cell having the least cost. Allocate to
this cell as much as possible depending on the capacity and requirements.
Step 4 Delete the row or column which is fully exhausted. Again compute the column and row
penalties for the reduced transportation table and then go to step (2). Repeat the procedure
until all the rim requirements are satisfied.
Note If the column is exhausted, then there is a change in row penalty and vice versa.

Test for Optimization


Solutions so obtained from the Initial basic feasible solution may be optimal or may not be optimal, so it
becomes essential for us to test for optimization. For this purpose we first define non-degenerate basic
feasible solution.
Definition: A basic feasible solution of an (m × n) transportation problem is said to be non-
degenerate if it has following two properties :
a. Initial basic feasible solution must contain exactly m+n–1 number of individual allocations.
b. These allocations must be in independent positions. Independent positions of a set of allocations
mean that it is always impossible to form any closed loop through these allocations. See fig.
given below.
The following theorem is also helpful in testing the optimality.
Theorem: If we have a B.F.S. consisting of m+n–1 independent positive allocations and a set of
arbitrary number ui and vj (i=1,2,...m; j=1,2,...n) such that crs = ur+vs for all occupied cells ( r,s) then
the evaluation dij corresponding to each empty cell (i, j) is given by dij = cij – (ui+vj)

Algorithm for optimality test


In order to test for optimality we should follow the procedure as given below:
Step 1 Start with B.F.S. consisting of m+n–1 allocations in independent positions.
Step 2 Determine a set of m+n numbers ui (i=1,2,....m) and vj (j=1,2,...n) such that for each
occupied cells (r,s) crs = ur+vs
Step 3 Calculate cell evaluations (unit cost difference) dj for each empty cell (i,j) by using the
formula dij = cij – ( ui+vj )
Step 4 Examine the matrix of cell evaluation dij for negative entries and conclude that
I. If all di > 0 ⇒ Solution is optimal and unique.
II. If all dij ≥ 0 ⇒ At least one dij = 0 ⇒ Solution is optimal and alternate solution
also exists.
III. If at least one dij < 0 ⇒ Solution is not optimal. If it is so, further improvement is
required by repeating the above process. See step 5 and onwards.
Step 5
I. See the most negative cell in the matrix [dij].
II. Allocate θ to this empty cell in the final allocation table. Subtract and add the amount
of this allocation to other corners of the loop in order to restore feasibility.
III. The value of θ, in general is obtained by equating to zero the minimum of the
allocations containing –θ
Solution
Vogel's Approximation Method (VAM)

D1 D2 D3 D4

F1 9 7 12 8 18

F2 15 12 12 15 4

F3 8 9 6 12 6

F4 14 12 11 12 12

6 14 15 5 40

D1 D2 D3 D4 Penalty0 Penalty0 Penalty0


1 2 3
F1 9 [04] 7 [14] 12 8 18 1 1

F2 15 12 12 [04] 15 4 0 0 3

F3 8 9 6 [06] 12 6 2

F4 14 [02] 12 11 [05] 12 [05] 12 1 1 1

6 14 15 5 40
Penalty0 1 2 5 4
1
Penalty0 5 5 1 4
1
Penalty0 5 1 4
1
Optimality test

V1=9 , 9 V2=7 , 7 V31=6 , 7 V4=7 , 8

D1 D2 D3 D4

U1=0 , 0 F1 9 [04] 7 [14] 12 8


>0 , >0 >0 ,=0
U2=6 , 6 F2 15 12 12 [04] 15
>0 ,=0 =-1 >0
U3=0 , -1 F3 8 [02] 9 6 [06] , [04] 12
=-1 >0 >0
U4=5 , 4 F4 14 [02] , [0] 12 11 [05] , [07] 12 [05]
=0

 
MAX = 2

 
Conclusion

“Right the answer”

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy