<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[MTH601 Quiz 3 Solution and Discussion]]></title><description><![CDATA[<p dir="auto">Please share your current Quiz to help the Students…</p>
]]></description><link>https://community.secnto.com//topic/246/mth601-quiz-3-solution-and-discussion</link><generator>RSS for Node</generator><lastBuildDate>Mon, 08 Jun 2026 23:01:20 GMT</lastBuildDate><atom:link href="https://community.secnto.com//topic/246.rss" rel="self" type="application/rss+xml"/><pubDate>Wed, 31 Jul 2019 10:36:03 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:21:02 GMT]]></title><description><![CDATA[<p dir="auto">The objective of a transportation problem is to develop an ----------- transportation schedule that meets all demand from given stock at a ------- total shipping cost. MTH601<br />
(integral, maximum)</p>
]]></description><link>https://community.secnto.com//post/3924</link><guid isPermaLink="true">https://community.secnto.com//post/3924</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:21:02 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:20:47 GMT]]></title><description><![CDATA[<p dir="auto">The North – West Corner Rule MTH601</p>
<pre><code>Is based on the concept of minimizing opportunity cost.
</code></pre>
]]></description><link>https://community.secnto.com//post/3923</link><guid isPermaLink="true">https://community.secnto.com//post/3923</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:20:47 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:20:36 GMT]]></title><description><![CDATA[<p dir="auto">The assignment problem is unbalanced if the cost matrix is not a ------------matrix. MTH601<br />
square<br />
rectangle<br />
not square</p>
]]></description><link>https://community.secnto.com//post/3922</link><guid isPermaLink="true">https://community.secnto.com//post/3922</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:20:36 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:20:23 GMT]]></title><description><![CDATA[<p dir="auto">If a balanced Transportation problem with ‘7’ sources and ‘6’sinks then its non-degenerate basic feasible solution will have---------- independent allocations. MTH601<br />
10</p>
]]></description><link>https://community.secnto.com//post/3921</link><guid isPermaLink="true">https://community.secnto.com//post/3921</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:20:23 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:20:11 GMT]]></title><description><![CDATA[<p dir="auto">For North West Corner method, in the first row and first column, resource and sink contain ‘5’ and ‘7’ units respectively; then after allocating the appropriate amount ‘x11’ in the cell (1,1), we will move towards which of the following cell? MTH601<br />
(2,2)</p>
]]></description><link>https://community.secnto.com//post/3920</link><guid isPermaLink="true">https://community.secnto.com//post/3920</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:20:11 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:20:01 GMT]]></title><description><![CDATA[<p dir="auto">For the project of a firm, if ‘5’ sales persons are assigned ‘5’ different sales territories, then in how many ways a single territory can be assigned to a single sale person? MTH601</p>
<p dir="auto">120</p>
]]></description><link>https://community.secnto.com//post/3919</link><guid isPermaLink="true">https://community.secnto.com//post/3919</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:20:01 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:19:49 GMT]]></title><description><![CDATA[<p dir="auto">zareen<br />
zareen Cyberian’s Gold 11 minutes ago</p>
<p dir="auto">The objective of a transportation problem is to develop an ----------- transportation schedule that meets all demand from given stock at a ------- total shipping cost. MTH601<br />
(integral, maximum)</p>
]]></description><link>https://community.secnto.com//post/3918</link><guid isPermaLink="true">https://community.secnto.com//post/3918</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:19:49 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:19:33 GMT]]></title><description><![CDATA[<p dir="auto">The North – West Corner Rule MTH601</p>
<pre><code>Is based on the concept of minimizing opportunity cost.
</code></pre>
]]></description><link>https://community.secnto.com//post/3917</link><guid isPermaLink="true">https://community.secnto.com//post/3917</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:19:33 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:19:19 GMT]]></title><description><![CDATA[<p dir="auto">The assignment problem is unbalanced if the cost matrix is not a ------------matrix. MTH601<br />
square<br />
rectangle<br />
not square</p>
]]></description><link>https://community.secnto.com//post/3916</link><guid isPermaLink="true">https://community.secnto.com//post/3916</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:19:19 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:19:07 GMT]]></title><description><![CDATA[<p dir="auto">If a balanced Transportation problem with ‘7’ sources and ‘6’sinks then its non-degenerate basic feasible solution will have---------- independent allocations. MTH601</p>
]]></description><link>https://community.secnto.com//post/3915</link><guid isPermaLink="true">https://community.secnto.com//post/3915</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:19:07 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:18:49 GMT]]></title><description><![CDATA[<p dir="auto">If a balanced Transportation problem with ‘m’ sources and ‘n’ sinks then degeneracy will arise only if there are less than ---------- independent allocations in the solution. MTH601<br />
m+n–1</p>
]]></description><link>https://community.secnto.com//post/3914</link><guid isPermaLink="true">https://community.secnto.com//post/3914</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:18:49 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:18:15 GMT]]></title><description><![CDATA[<p dir="auto">For an unbalanced Transportation problem, if the total demand is LESS than total supply then which of the following is true in order to balance the problem? MTH601</p>
<pre><code>A dummy sink would have to include with demand equal to the surplus
</code></pre>
]]></description><link>https://community.secnto.com//post/3913</link><guid isPermaLink="true">https://community.secnto.com//post/3913</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:18:15 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:17:00 GMT]]></title><description><![CDATA[<p dir="auto">In the Vogel’s approximation Method for solving a Transportation problem, Penalty measure for any row or column, is given by which of the following? MTH601<br />
Difference between the largest unit cost to the next largest cost in the same row(column)</p>
]]></description><link>https://community.secnto.com//post/3912</link><guid isPermaLink="true">https://community.secnto.com//post/3912</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:17:00 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Tue, 04 Feb 2020 18:16:29 GMT]]></title><description><![CDATA[<p dir="auto">In the assignment problem, the cost matrix is ------------. MTH601<br />
rectangular</p>
]]></description><link>https://community.secnto.com//post/3911</link><guid isPermaLink="true">https://community.secnto.com//post/3911</guid><dc:creator><![CDATA[zareen]]></dc:creator><pubDate>Tue, 04 Feb 2020 18:16:29 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Sat, 10 Aug 2019 12:32:08 GMT]]></title><description><![CDATA[<p dir="auto"><img src="/assets/uploads/files/1565440285759-2019-08-10.png" alt="2019-08-10.png" class=" img-fluid img-markdown" /> <img src="/assets/uploads/files/1565440285391-2019-08-10-8.png" alt="2019-08-10 (8).png" class=" img-fluid img-markdown" /> <img src="/assets/uploads/files/1565440285139-2019-08-10-7.png" alt="2019-08-10 (7).png" class=" img-fluid img-markdown" /> <img src="/assets/uploads/files/1565440284959-2019-08-10-6.png" alt="2019-08-10 (6).png" class=" img-fluid img-markdown" /> <img src="/assets/uploads/files/1565440284773-2019-08-10-5.png" alt="2019-08-10 (5).png" class=" img-fluid img-markdown" /> <img src="/assets/uploads/files/1565440284585-2019-08-10-4.png" alt="2019-08-10 (4).png" class=" img-fluid img-markdown" /> <img src="/assets/uploads/files/1565440283855-2019-08-10-3.png" alt="2019-08-10 (3).png" class=" img-fluid img-markdown" /> <img src="/assets/uploads/files/1565440283525-2019-08-10-2.png" alt="2019-08-10 (2).png" class=" img-fluid img-markdown" /> <img src="/assets/uploads/files/1565440282650-2019-08-10-1-nn.png" alt="2019-08-10 (1)nn.png" class=" img-fluid img-markdown" /> <img src="/assets/uploads/files/1565440282528-2019-08-10-1.png" alt="2019-08-10 (1).png" class=" img-fluid img-markdown" /></p>
]]></description><link>https://community.secnto.com//post/912</link><guid isPermaLink="true">https://community.secnto.com//post/912</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Sat, 10 Aug 2019 12:32:08 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Sat, 10 Aug 2019 12:25:37 GMT]]></title><description><![CDATA[<p dir="auto">1_ If a balanced Transportation problem with ‘m’ sources and ‘n’ sinks then degeneracy will arise only if there are less than ---------- independent allocations in the solution.</p>
<p dir="auto"><strong>m–n–1</strong><br />
(In this question all options are in (-) negative range like m–n–1 , m–n–2 m–n–3, m–n–4 )<br />
and there was no one true. correct was m+n–1 .however i select m–n–1 ).</p>
<p dir="auto">2_In a Transportation Problem, the objective function ’Z’ gives ----------.<br />
<strong>Total Cost of transportation</strong></p>
<p dir="auto">3_Which of the following type of Elementary matrix operations are performed while solving an Assignment problem by Hungarian’s method?<br />
<strong>Column operations (not sure)</strong></p>
<p dir="auto">4_For North West Corner method, in the first row and first column, resource and sink contain ‘5’ and ‘7’ units respectively; then after allocating the appropriate amount ‘x11’ in the cell (1,1), we will move towards which of the following cell?<br />
<strong>missed</strong></p>
<p dir="auto">5_To convert an Assignment problem into a maximization problem, which of the following operations would have to apply?<br />
<strong>Deduct all elements of the row from highest element in that row</strong></p>
<p dir="auto">6_In the assignment problem, the decision variable ‘xij’ can attain which of the following value?<br />
<strong>Only ‘1’</strong><br />
Ref:<br />
Pg 97<br />
Optimization for Decision Making: Linear and Quadratic Models<br />
By Katta G Murty<br />
<a href="https://books.google.com.pk/books?id=HWZXs1rkVxEC&amp;pg=PA97&amp;l" target="_blank" rel="noopener noreferrer nofollow ugc">https://books.google.com.pk/books?id=HWZXs1rkVxEC&amp;pg=PA97&amp;l</a>…<br />
7_In</p>
<p dir="auto">Hungarian method of solving assignment problem, the cost matrix is obtained by----------.<br />
<strong>subtracting the smallest element from all other elements of the row.</strong></p>
<p dir="auto">8_If the total demand is equal to total supply as per requirement of a balanced transportation problem i-e “a1+a2±–+an = b1+b2±–+bn” then which of the following is true?<br />
<strong>“a1=b1, a2=b2,—, an=bn” is necessarily implied  (not sure)</strong></p>
<p dir="auto">9_In case the cost elements of one or two cells are not given in the problem, it means that ---------<br />
<strong>the routes connected by those cells are not available</strong></p>
<p dir="auto">10_ If the cost matrix in an Assignment problem is not square then which the following modification will be made to balance the given problem?<br />
<strong>Add a dummy row(column) with negative cost elements (not sure)</strong></p>
]]></description><link>https://community.secnto.com//post/911</link><guid isPermaLink="true">https://community.secnto.com//post/911</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Sat, 10 Aug 2019 12:25:37 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Sat, 10 Aug 2019 12:20:58 GMT]]></title><description><![CDATA[<p dir="auto">When the total allocations in a transportation model of m*n size is not equals to “m + n – 1”, the situation is known as:</p>
<p dir="auto"><strong>Unbalanced situation</strong></p>
<p dir="auto">In North West Corner method, the first step after choosing the appropriate cell in 1st row, we allocate -------------so that the capacity of first row or first column is exhausted.<br />
<strong>as much as possible</strong></p>
<p dir="auto">For an unbalanced Transportation problem, if the total demand is MORE than total supply then which of the following is true in order to balance the problem?<br />
<strong>a dummy sink…</strong></p>
<p dir="auto">In the assignment problem, the decision variable ‘xij’ can attain which of the following value?<br />
<strong>Only ‘1’</strong></p>
<p dir="auto">The row, which is introduced in the matrix to balance an unbalnced Transportation problem, is known as ----------.<br />
<strong>dummy row (confirm)</strong></p>
<p dir="auto">The solution of a transportation problem with m rows (supplies) and n (destinations) is feasible if numbers of positive allocations are<br />
<strong>m+n-1 (confirm)</strong></p>
<p dir="auto">While solving an Assignment problem by Hungarian’s method, in the modified cost matrix if the minimum number of horizontal and vertical lines to cover zeros are not equal to the number of rows (or columns), then which of the following operation is done?<br />
<strong>Subtract smallest element of uncovered rows from all other elements of uncovered cells</strong></p>
<p dir="auto">The amounts shipped from a dummy source represent shortages at the receiving destinations<br />
<strong>True (confirm)</strong></p>
<p dir="auto">In the Vogel’s approximation Method for solving a Transportation problem, Penalty measure for any row or column, is given by which of the following?<br />
<strong>Difference between the smallest unit cost to the next smallest cost in the same row(column)</strong></p>
]]></description><link>https://community.secnto.com//post/909</link><guid isPermaLink="true">https://community.secnto.com//post/909</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Sat, 10 Aug 2019 12:20:58 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Sat, 10 Aug 2019 12:18:24 GMT]]></title><description><![CDATA[<p dir="auto">The column, which is introduced in the matrix to balance an unbalanced Transportation problem, is known as-------</p>
<p dir="auto"><strong>dummy column</strong></p>
]]></description><link>https://community.secnto.com//post/908</link><guid isPermaLink="true">https://community.secnto.com//post/908</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Sat, 10 Aug 2019 12:18:24 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Sat, 10 Aug 2019 12:16:39 GMT]]></title><description><![CDATA[<p dir="auto">The Transportation Problem is one of the sub-class of -------------.</p>
]]></description><link>https://community.secnto.com//post/907</link><guid isPermaLink="true">https://community.secnto.com//post/907</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Sat, 10 Aug 2019 12:16:39 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Sat, 10 Aug 2019 12:14:34 GMT]]></title><description><![CDATA[<p dir="auto">In North West Corner method, the first step after choosing the appropriate cell in 1st row, we allocate -------------so that the capacity of first row or first column is exhausted.<br />
<strong>as much as possible</strong></p>
<p dir="auto"><img src="/assets/uploads/files/1565439260845-d4c12ba0-c079-42f1-a474-834e9c2cfb86-image.png" alt="d4c12ba0-c079-42f1-a474-834e9c2cfb86-image.png" class=" img-fluid img-markdown" /></p>
]]></description><link>https://community.secnto.com//post/906</link><guid isPermaLink="true">https://community.secnto.com//post/906</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Sat, 10 Aug 2019 12:14:34 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Sat, 10 Aug 2019 12:13:04 GMT]]></title><description><![CDATA[<p dir="auto">For North West Corner method, in the first row and first column, each resource and sink contain ‘5’ units; then after allocating the appropriate amount ‘x11’ in the cell (1,1), in which of the following cell the next allocation will be zero?</p>
]]></description><link>https://community.secnto.com//post/905</link><guid isPermaLink="true">https://community.secnto.com//post/905</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Sat, 10 Aug 2019 12:13:04 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Sat, 10 Aug 2019 12:11:11 GMT]]></title><description><![CDATA[<p dir="auto">The solution of an Assignment problem can be arrived by using which of the following method?</p>
]]></description><link>https://community.secnto.com//post/904</link><guid isPermaLink="true">https://community.secnto.com//post/904</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Sat, 10 Aug 2019 12:11:11 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Sat, 10 Aug 2019 12:09:20 GMT]]></title><description><![CDATA[<p dir="auto">The North – West Corner Rule</p>
]]></description><link>https://community.secnto.com//post/903</link><guid isPermaLink="true">https://community.secnto.com//post/903</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Sat, 10 Aug 2019 12:09:20 GMT</pubDate></item><item><title><![CDATA[Reply to MTH601 Quiz 3 Solution and Discussion on Sat, 10 Aug 2019 12:07:21 GMT]]></title><description><![CDATA[<p dir="auto">In the Vogel’s approximation Method for solving a Transportation problem, Penalty measure for any row or column, is given by which of the following?</p>
]]></description><link>https://community.secnto.com//post/902</link><guid isPermaLink="true">https://community.secnto.com//post/902</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Sat, 10 Aug 2019 12:07:21 GMT</pubDate></item></channel></rss>