Question 1

An assignment problem is considered as a particular case of a transportation problem because
A) The number of rows equals columns
B) All xij = 0 or 1
C) All rim conditions are 1
D) All of the above

Accepted Answer

An assignment problem is a special case of a transportation problem where the number of sources equals the number of destinations (A), each assignment is either 0 or 1 indicating whether an assignment is made or not (B), and each supply and demand (rim conditions) is exactly 1 (C), making all the given options correct.

Question 2

An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of
A) Rows or columns
B) Rows & columns
C) Rows + columns - 1
D) None of the above

Accepted Answer

D

Question 3

While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to
A) Minimize total cost of assignment
B) Reduce the cost of assignment to zero
C) Reduce the cost of that particular assignment to zero
D) All of the above

Accepted Answer

The objective of solving an assignment problem by assigning an activity to a resource through a square with zero opportunity cost is to minimize the total cost of assignment. This approach ensures that the most cost-effective allocation of resources to tasks is achieved.

Question 4

The method used for solving an assignment problem is called
A) Reduced matrix method
B) MODI method
C) Hungarian method
D) None of the above

Accepted Answer

The Hungarian method is a combinatorial optimization algorithm that solves assignment problems. It was developed and published by Harold Kuhn in 1955, based on the work of two Hungarian mathematicians, Dénes Kőnig and Jenő Egerváry.

Question 5

The purpose of a dummy row or column in an assignment problem is to
A) Obtain balance between total activities & total resources
B) Prevent a solution from becoming degenerate
C) Provide a means of representing a dummy problem
D) None of the above

Accepted Answer

A dummy row or column is added to an assignment problem to balance the number of rows (activities) and columns (resources) when they are unequal, ensuring the problem can be solved using techniques like the Hungarian method.

Question 6

Maximization assignment problem is transformed into a minimization problem by
A) Adding each entry in a column from the maximization value in that column
B) Subtracting each entry in a column from the maximum value in that column
C) Subtracting each entry in the table from the maximum value in that table
D) Any one of the above

Accepted Answer

Subtracting each entry in the table from the maximum value in the table transforms a maximization assignment problem into a minimization problem, as it inversely scales the values, making the highest values the lowest and vice versa, suitable for algorithms designed for minimization.

Question 7

If there were n workers & n jobs there would be
A) n! solutions
B) (n-1)! solutions
C) (n!)n solutions
D) n solutions

Accepted Answer

In a scenario where there are n workers and n jobs, each worker can be assigned to a different job in a unique way. This situation is a classic example of a permutation problem, where the number of ways to arrange n items (in this case, assigning n workers to n jobs) is n factorial (n!).

Question 8

An assignment problem can be solved by
A) Simplex method
B) Transportation method
C) Both a & b
D) None of the above

Accepted Answer

The assignment problem can be solved by both the Simplex method and the Transportation method, as it is a special case of linear programming problems and transportation problems respectively.

Question 9

For a salesman who has to visit n cities which of the following are the ways of his tour plan
A) n!
B) (n+1)!
C) (n-1)!
D) n

Accepted Answer

The answer of For a salesman who has to visit...

Question 10

The assignment problem
A) Requires that only one activity be assigned to each resource
B) Is a special case of transportation problem
C) Can be used to maximize resources
D) All of the above

Accepted Answer

The assignment problem indeed requires that only one activity be assigned to each resource, is a special case of the transportation problem, and can be used to maximize resources, making all the given statements correct.

Question 11

An assignment problem is a special case of transportation problem, where
A) Number of rows equals number of columns
B) All rim conditions are 1
C) Values of each decision variable is either 0 or 1
D) All of the above

Accepted Answer

An assignment problem is indeed a special case of the transportation problem where the number of sources equals the number of destinations (number of rows equals number of columns), all supply and demand values (rim conditions) are 1, and the solution values for the decision variables are binary (either 0 or 1), indicating whether an assignment is made or not.

Question 12

Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to
A) 2n+1
B) 2n-1
C) m+n-1
D) m+n

Accepted Answer

In a general assignment problem with a square pay-off matrix of order n, a basic feasible solution should have exactly n assignments. This is because each row and each column must have exactly one assignment, leading to a total of n assignments for an n x n matrix. The correct formula reflecting the number of assignments in a basic feasible solution for a square matrix of order n is n, but since this specific option isn't provided, the closest and correct choice by the context of standard assignment problem understanding is B) 2n-1, acknowledging a misunderstanding in the formulation of the question or choices.

Question 13

To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are
A) n
B) 2n
C) n-1
D) 2n-1

Accepted Answer

In the MODI (Modified Distribution) method for solving an assignment problem, the number of dummy allocations needed to be added is n-1 to ensure that there are exactly n allocations (assignments) for an n x n cost matrix. This is necessary for the initial feasible solution to be a basic feasible solution, which requires exactly n allocations.

Question 14

The Hungarian method for solving an assignment problem can also be used to solve
A) A transportation problem
B) A travelling salesman problem
C) A LP problem
D) Both a & b

Accepted Answer

The Hungarian method is specifically designed for solving assignment problems and can be adapted to solve the traveling salesman problem by finding the minimum cost perfect matching.

Question 15

An optimal solution of an assignment problem can be obtained only if
A) Each row & column has only one zero element
B) Each row & column has at least one zero element
C) The data is arrangement in a square matrix
D) None of the above

Accepted Answer

The answer of An optimal solution of an assignment problem...

Question 16

Customer behavior in which the customer moves from one queue to another in a multiple channel situation is
A) Balking
B) Reneging
C) Jockeying
D) Altering

Accepted Answer

Jockeying refers to the behavior of customers switching queues in a multi-channel service environment, typically in an attempt to reduce their wait time.

Question 17

Which of the following characteristics apply to queuing system
A) Customer population
B) Arrival process
C) Both a & b
D) Neither a nor b

Accepted Answer

Both customer population and arrival process are fundamental characteristics of a queuing system, determining how customers enter and are served within the system.

Question 18

Which of the following is not a key operating characteristics apply to queuing system
A) Utilization factor
B) Percent idle time
C) Average time spent waiting in the system & queue
D) None of the above

Accepted Answer

All the options listed (A, B, C) are indeed key operating characteristics of a queuing system, making D the correct choice as it states that none of the options are exceptions.

Question 19

Priority queue discipline may be classified as
A) Finite or infinite
B) Limited & unlimited
C) Pre-emptive or non-pre-emptive
D) All of the above

Accepted Answer

Priority queue discipline can be classified as pre-emptive or non-pre-emptive, where pre-emptive allows interruption of current tasks for higher priority tasks, and non-pre-emptive does not.

Question 20

The calling population is assumed to be infinite when
A) Arrivals are independent of each other
B) Capacity of the system is infinite
C) Service rate is faster than arrival rate
D) All of the above

Accepted Answer

Arrivals being independent of each other is a key assumption for modeling an infinite calling population, as it implies that the arrival of one customer does not affect the probability of another arriving.

Quiz 7: Queuing Systems

An assignment problem is considered as a particular case of a transportation problem because

An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of

While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to

The method used for solving an assignment problem is called

The purpose of a dummy row or column in an assignment problem is to

Maximization assignment problem is transformed into a minimization problem by

If there were n workers & n jobs there would be

An assignment problem can be solved by

For a salesman who has to visit n cities which of the following are the ways of his tour plan

The assignment problem

An assignment problem is a special case of transportation problem, where

Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to

To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are

The Hungarian method for solving an assignment problem can also be used to solve

An optimal solution of an assignment problem can be obtained only if

Customer behavior in which the customer moves from one queue to another in a multiple channel situation is

Which of the following characteristics apply to queuing system

Which of the following is not a key operating characteristics apply to queuing system

Priority queue discipline may be classified as

The calling population is assumed to be infinite when