Assessment sub x | Swayam Dene > (https://swayam,gov.in) ® Ahtostonayor goxinedetatsNeTEL) mba2021_prince_kumar@aimt.ac.in NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Data Analysis & Decision Making - Ill (course) Course outline How does an NPTEL online work? () Week 0() Wook 1 () Week 2 () Week 3 () Week 4 () woek 5() Week 6() Week 7 () Lecture 31 ‘Transportation problem (unit? Unit=538lesson=54) Lecture 32 ‘Transportation Thank you for taking the Week 7: Assignment 7. Week 7: Assignment 7 ‘Your last recorded submission was on 2022-09-03, 19:53 Due date: 2022.09.14, 23:59 IST. Ist 1) Which of the following is not a method to solve transportation problem 1 point Vogel's Approximation method ONorth West Side method Row Minima rule @ Column Minima rule 2) In Voge"'s Approximation method 1 point O itoften produces an optimal solution tothe problem in just one tration CO tt does not guarantee an optimal solution O In spite of this it does produce a very good initial solution with comparatively less effort @Allof the above 3) In Vogel's Approximation method after you calculate the difference between the two 1 point lowest costs for each row and column you select the raw or column with the largest penalty and Circle this value. In case ofa tie, select that row or column that allows the greatest ‘movement of units Otne @talse 4) In row minima rule: 1 pointproblem (unit? Assessment subauiistss) x Lecture 33: Transportation problem (un Unit=538lessor Lecture 34:Transportation problem (unit? unit=538lesso @ Lecture 35: Loss function (© Quiz: Week 7: Assignment 7 (assessment? DOWNLOAD VIDEOS () Transcripts () Live Session 0 O Incase there are more than two minima in a row make the decision of choosing arbitrary O In case there are more than two minima in a column make the decision of choosing lower one in the row in case row and colurm availbily is satisfied simultaneously, cross off the column GA of the above 5) In column minima rule: 1 point @ Select the minimum cost cell and allocate based on imitation of row avalably and column requirement Ot column total is exhausted (based on minimum cost elements for that cokimn) we proceed to next column n and continue in the same procedure © itrow total is exhausted (based on minimum cost elements for that row) we proceed to next row and continue in the same procedure, The moment the row or column gets satisfied delete i rom further consideration Olaf the above 6) In transportation problem by degeneracy we mean: 1 point OMore than one solution ON solution O only one solution O Infinite solutions: 7) or are used to "balance" an assignment or transportation 1 point problem. O Destinations; sources. units supplie nits demanded © Dummy rows; dummy columns O Large cost coefficients; small cost coefficients 8) The procedure used to solve assignment problems wherein one reduces the original’ point assignment costs to a table of opportunity costs is called O stepping-stone method © matrix reduction Onorthwest reduction O simplex reduction 9) The method of finding an initial solution based upon opportunity costs is called 1 point Othe northwest comer rule @ Voges approximation O Johanson’ theorem O Hungarian method 10). ‘occurs when the number of occupied squares is less than the number 1 point of rowsplus the number of columns minus one. Assessment submitted x © degeneracy O inteasibitty O Unboundedness OUnbalance You may submit any number of times before the due date. The final submission will be considered for grading,