Question 1

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

Accepted Answer

A)  2n+1 
B)  2n-1 
C)  m+n-1 
D)  m+n 
A)  2n+1 
B)  2n-1 
C)  m+n-1 
D)  m+n B

Question 2

Maximization assignment problem is transformed into a minimization problem by

Accepted Answer

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 
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 C

Question 3

Priority queue discipline may be classified as

Accepted Answer

A)  Finite or infinite 
B)  Limited & unlimited 
C)  Pre-emptive or non-pre-emptive 
D)  All of the above 
A)  Finite or infinite 
B)  Limited & unlimited 
C)  Pre-emptive or non-pre-emptive 
D)  All of the above C

Question 4

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

Accepted Answer

A)  Utilization factor 
B)  Percent idle time 
C)  Average time spent waiting in the system & queue 
D)  None of the above 
A)  Utilization factor 
B)  Percent idle time 
C)  Average time spent waiting in the system & queue 
D)  None of the above

Question 5

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

Accepted Answer

A)  The number of rows equals columns 
B)  All xij = 0 or 1 
C)  All rim conditions are 1 
D)  All of the above 
A)  The number of rows equals columns 
B)  All xij = 0 or 1 
C)  All rim conditions are 1 
D)  All of the above

Question 6

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

Accepted Answer

A)  A transportation problem 
B)  A travelling salesman problem 
C)  A LP problem 
D)  Both a & b 
A)  A transportation problem 
B)  A travelling salesman problem 
C)  A LP problem 
D)  Both a & b

Question 7

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

Accepted Answer

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 
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

Question 8

Which of the following characteristics apply to queuing system

Accepted Answer

A)  Customer population 
B)  Arrival process 
C)  Both a & b 
D)  Neither a nor b 
A)  Customer population 
B)  Arrival process 
C)  Both a & b 
D)  Neither a nor b

Question 9

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

Accepted Answer

A)  n 
B)  2n 
C)  n-1 
D)  2n-1 
A)  n 
B)  2n 
C)  n-1 
D)  2n-1

Question 10

If there were n workers & n jobs there would be

Accepted Answer

A)  n! solutions 
B)  (n-1)! solutions 
C)  (n!)n solutions 
D)  n solutions 
A)  n! solutions 
B)  (n-1)! solutions 
C)  (n!)n solutions 
D)  n solutions

Question 11

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

Accepted Answer

A)  Balking 
B)  Reneging 
C)  Jockeying 
D)  Altering 
A)  Balking 
B)  Reneging 
C)  Jockeying 
D)  Altering

Question 12

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

Accepted Answer

A)  n! 
B)  (n+1)! 
C)  (n-1)! 
D)  n 
A)  n! 
B)  (n+1)! 
C)  (n-1)! 
D)  n

Question 13

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

Accepted Answer

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 
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

Question 14

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

Accepted Answer

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 
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

Question 15

The method used for solving an assignment problem is called

Accepted Answer

A)  Reduced matrix method 
B)  MODI method 
C)  Hungarian method 
D)  None of the above 
A)  Reduced matrix method 
B)  MODI method 
C)  Hungarian method 
D)  None of the above

Question 16

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

Accepted Answer

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 
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

Question 17

An assignment problem can be solved by

Accepted Answer

A)  Simplex method 
B)  Transportation method 
C)  Both a & b 
D)  None of the above 
A)  Simplex method 
B)  Transportation method 
C)  Both a & b 
D)  None of the above

Question 18

The assignment problem

Accepted Answer

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 
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

Question 19

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

Accepted Answer

A)  Rows or columns 
B)  Rows & columns 
C)  Rows + columns - 1 
D)  None of the above 
A)  Rows or columns 
B)  Rows & columns 
C)  Rows + columns - 1 
D)  None of the above

Question 20

The calling population is assumed to be infinite when

Accepted Answer

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 
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

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

Maximization assignment problem is transformed into a minimization problem by

Priority queue discipline may be classified as

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

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

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

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

Which of the following characteristics apply to queuing system

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

If there were n workers & n jobs there would be

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

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

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

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

The method used for solving an assignment problem is called

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

An assignment problem can be solved by

The assignment problem

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

The calling population is assumed to be infinite when

Linear Programming and Decision-Making Techniques

Markov Analysis, Queuing Theory, Operations Research and Mathematical Modeling

Simulation Modeling and Analysis

Linear Programming and Project Management

Linear Programming Models and Techniques

LP and Transportation Models: Assumptions, Limitations, and Solutions

Markov Analysis and Simulation Techniques for Queuing Systems

Filters

Exam 7: Queuing Systems

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

Maximization assignment problem is transformed into a minimization problem by

Priority queue discipline may be classified as

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

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

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

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

Which of the following characteristics apply to queuing system

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

If there were n workers & n jobs there would be

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

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

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

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

The method used for solving an assignment problem is called

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

An assignment problem can be solved by

The assignment problem

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

The calling population is assumed to be infinite when

Linear Programming and Decision-Making Techniques

Markov Analysis, Queuing Theory, Operations Research and Mathematical Modeling

Simulation Modeling and Analysis

Linear Programming and Project Management

Linear Programming Models and Techniques

LP and Transportation Models: Assumptions, Limitations, and Solutions

Markov Analysis and Simulation Techniques for Queuing Systems

Filters