DefinePK hosts the largest index of Pakistani journals, research articles, news headlines, and videos. It also offers chapter-level book search.
2020-08-24 05:06:00
00:12:35
Urdu
theiteducation Transportation Problem Vogel's Approximation Method URDU Determine the difference rudu rows and columns lowest-cost cell highest difference row and column requirements Example of VAM urdu Unit cost penalty method computation of penalty urdu calculate the penalty Tansportation model urdu mth601 mth 601 mth601 short lectures vu short lectures Operations Research Urdu lectures Least cost method urdu north west corner method urdu vu final term
Video content is provided via the
YouTube platform.
All rights and ownership belong to the original content creator.
Source channel:
theITeducation.com
Join our Telegram Group for Fast updates and VU Short Lectures https://t.me/joinchat/TFLF2vbjfq5qs4Ww 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.
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.
Key Topics of the Video are
1. What is Transportation Problem?
2. What are different Transpostation 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
join us
https://web.facebook.com/groups/theiteducation/
like us on Facebook Page
https://web.facebook.com/theiteducation
subscribe out YouTube Channel
https://www.youtube.com/c/TheITeducation2015?sub_confirmation=1
out website for more tutorials related to programming , office automation and e-commerce.
visit our blog.
http://theiteducation.com/
#TheITeducation #OnlineLectures #OnlineLecture #OnlineLectureVideo
comments for any further query... #vushortlectures
TheITeducation.com is the best channel for VU Short Lectures of All Subjects.