# Transportation Problem Solution by Vogel’s Approximation Method in Urdu and Hindi

This online video lecture explained Vogel’s Approximation Method (VAM) for Transportaion Problem for #MTH601 Students of #VU and BSIT, BSCS and BSSE stduents of #GCUF in #Urdu and Hindi.
Vogel’s Aproximation Method
This method is based on the ‘difference’ associated with each row and column in the matrix giving unit cost of transportation cij. This ‘difference’ is defined as the arithmetic difference between the smallest and next to the
smallest element in that row or column. This difference in a row or column indicates the minimum unit penalty incurred in failing to make an allocation to the smallest cost cell in that row or column. This difference also provides a measure of proper priorities for making allocations to the respective rows and column.

### Steps of Vogel’s Approximation Method

A summary of the steps involved in Vogel’s Approximation Method is given below:

• STEP 1: Represent the transportation problem in the standard tabular form.
• STEP 2: Select the smallest element in each row and the next to the smallest element in that row. Find the
• difference. This is the penalty written on the right hand side of each row. Repeat the same for each column. The
• penalty is written below each column.
• STEP 3: Select the row or column with largest penalty. If there is a tie, the same can be broken arbitrarily.
• STEP 4: Allocate the maximum feasible amount to the smallest cost cell in that row or column.
• STEP 5: Allocate zero else where in the row or column where the supply or demand is exhausted.
• STEP 6: Remove all fully allocated rows or columns from further consideration. Then proceed with the remaining
• reduced matrix till no rows or columns remain.

### Transportation Problem Solution by Vogel’s Approximation Method Video in Urdu and Hindi

Key Topics of the Video are

1. What is Transportation Problem?
2. What are different Transportation Problem Solution methods?
3. What is Vogel’s Approximation method?
4. Steps of Vogel’s approximation method?
5. How to calculate Row and Column Penalty?
6. Comparison of NWC, LCM and VAM

#### Author: Habibullah Qamar

Its me Habib Ullah Qamar working as a Lecturer (Computer Sciences) in Pakistan. I have an MS(M.Phil) degree in computer sciences with specialization in software engineering from Virtual University of Pakistan Lahore. I have an experience of more than 15 years in the filed of Computer Science as a teacher. Blog Writing is my passion. I have many blogs, This one is special made with the aim of providing 100% Free online coaching and training to the students of under-graduate and postgraduate classes. Most of the students enrolled in computer sciences, information technology, software engineering and related disciplines find it difficult to understand core concepts of programming and office automation. They find difficult in understanding and solving their assignments.
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}