Scribd
Upload
12 views2 pages

Assignment

The document contains 10 multiple choice questions about transportation and assignment problems. The questions cover topics like the Hungarian method, balanced vs unbalanced transportation problems, and methods for solving degeneracy. The document tests understanding of key concepts in transportation and assignment problem modeling and solution techniques.

Uploaded by

BasSem Reda
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views2 pages

Assignment

The document contains 10 multiple choice questions about transportation and assignment problems. The questions cover topics like the Hungarian method, balanced vs unbalanced transportation problems, and methods for solving degeneracy. The document tests understanding of key concepts in transportation and assignment problem modeling and solution techniques.

Uploaded by

BasSem Reda
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment

Choose the correct answer of the following questions

1- The transportation problem is basically a

(A) Maximization model (B) Minimization model (C) Transshipment problem (D) Iconic model

2- The column, which is introduced in the matrix to balance the rim requirements, is known as

(A) Key column (B) Dummy Column (C) Idle column (D) Slack column

3- When the total allocations in a transportation model of 𝑚𝑚 × 𝑛𝑛 size do not equal to 𝑚𝑚 + 𝑛𝑛 − 1 the situation is
known as

(A) Unbalanced situation (B) Degeneracy (C) Tie situation (D) None of the above

4- The Assignment Problem is solved by

(A) Complex method (B) Hungarian method (C) Graphical method (D) Vector method

5- In a transportation problem where the demand or requirement is equal to the available resource is known as

(A) Regular transportation problem


(B) Balanced transportation problem
(C) Resource allocation transportation problem
(D) Simple transportation model

6- In Transportation Problems, VAM stands for .........................

(A) Value Addition Method


(B) Vogel’s Approximation Method
(C) Virgenian Approximation Method
(D) None of these

7-Which of the following methods is used to verify the optimality of the current solution of the transportation
problem?

(A) Least cost method


(B) Vogel’s approximation method
(C) Modified distribution method
(D) All of the above
8- To solve degeneracy in the transportation problem we have to

(A) Put allocation in one of the empty cells as zero o solve degeneracy in the transportation problem we have to
(B) Put a small element epsilon in any one of the empty cells
(C) Allocate the smallest element epsilon in such a cell, which will not form a closed-loop with other loaded cells
(D) Allocate the smallest element epsilon in such a cell, which will form a closed loop with other loaded cells

9- In the Hungarian method of solving an assignment problem, the row reduction is obtained by

(A) Dividing each row by the elements of the row above it


(B) Subtracting the elements of the row from the elements of the row above it
(C) Subtracting the smallest element from all other elements of the row
(D) Subtracting all the elements of the row from the highest element in the matrix

10- The horizontal and vertical lines drawn to cover all zeros of the total opportunity matrix for an optimal solution
must be

(A) Equal to each other


(B) Equal to 𝑚𝑚 × 𝑛𝑛 (where 𝑚𝑚 and 𝑛𝑛 are numbers of rows and columns)
(C) Equal to the number of rows or columns
(D) 𝑚𝑚 + 𝑛𝑛 (where 𝑚𝑚 and 𝑛𝑛 are numbers of rows and columns)

You might also like