Operation Research Set 3

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Free Online Best Operation Research MCQ Questions for improve your basic knowledge of Operation Research. This Operation Research set 3 test that contains 25 Multiple Choice Questions with 4 options. You have to select the right answer to a question.

Start

Congratulations - you have completed Operation Research Set 3.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1

When the allocations of a transportation problem satisfy the rim condition (m + n –1) the solution is called __________ solution

A	non-degenerate
B	degenerate
C	unbounded
D	infeasible

Question 2

When a maximization assignment problem is converted in minimization problem, the resulting matrix is called __________

A	Cost matrix
B	Profit matrix
C	Regret matrix
D	Dummy matrix

Question 3

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

Question 4

When a particular assignment in the given problem is not possible or restricted as a condition, it is called a __________ problem

A	infeasible
B	degenerate
C	unbalanced
D	prohibited

Question 5

The procedure used to solve assignment problems wherein one reduces the original assignment costs to a table of opportunity costs is called____

A	stepping-stone method
B	matrix reduction
C	MODI method
D	northwest reduction

Question 6

If M + N –1 = Number of allocations in transportation, it means _________. (Where ‘M’ is number ofrows and ‘N’ is number of columns)

A	There is no degeneracy
B	Problem is unbalanced
C	Problem is degenerate
D	Solution is optimal

Question 7

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

A	rows or columns
B	rows and columns.
C	rows+columns- 1
D	rows-columns.

Question 8

Which of the following is used to come up with a solution to the assignment problem?

A	MODI method
B	northwest corner method
C	stepping-stone method
D	Hungarian method

Question 9

Which of the following considers difference between two least costs for each row and column while finding initial basic feasible solution in transportation?

A	North west corner rule
B	Least cost method
C	Vogel’s approximation method
D	Row minima method

Question 10

____or____are used to "balance" an assignment or transportation problem

A	Destinations; sources
B	Units supplied; units demanded
C	Dummy rows; dummy columns
D	Large cost coefficients; small cost coefficients

Question 11

The extra row or column which is added to balance an assignment problem is called __________

A	regret
B	epsilon
C	dummy
D	extra

Question 12

In a transportation problem, the method of penalties is called __________ method.

A	least cost
B	south east corner
C	Vogel’s approximation
D	north west corner

Question 13

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

Question 14

When the total of allocations of a transportation problem match with supply and demand values, the solution is called __________ solution

A	non-degenerate
B	degenerate
C	feasible
D	infeasible

Question 15

An assignment problem can be viewed as a special case of transportation problem in which the capacity from each source is and the demand at each destination is___

A	1; 1
B	Infinity; infinity
C	0; 0
D	1000; 1000

Question 16

In a transportation problem, we must make the number of equal____

A	destinations; sources
B	units supplied; units demanded
C	.columns; rows
D	positive cost coefficients; negative cost coefficients

Question 17

The method of solution of assignment problems is called __________ method

A	NWCR
B	VAM
C	LCM
D	Hungarian

Question 18

Which of these statements about the stepping-stone method is best?

A	dummy source and destination must be added if the number of rows plus columns minus 1 is not equal to the number of filled squares
B	Only squares containing assigned shipments can be used to trace a path back to an empty square.
C	An improvement index that is a net positive means that the initial solution can be improved
D	Only empty squares can be used to trace a path back to a square containing an assigned shipment

Question 19

If the number of rows and columns in an assignment problem are not equal than it is called __________ problem

A	prohibited
B	infeasible
C	unbounded
D	unbalanced

Question 20

In assignment problem of maximization, the objective is to maximise____

A	Profit
B	optimization
C	cost
D	None of the above

Question 21

The equation Ri + Kj = Cij is used to calculate __________

A	an improvement index for the stepping-stone method
B	the opportunity costs for using a particular route
C	the MODI cost values (Ri, Kj)
D	the degeneracy index

Question 22

When there is a degeneracy in the transportation problem, we add an imaginary allocation called __________ in the solution

A	dummy
B	penalty
C	epsilon
D	regret

Question 23

The method of finding an initial solution based upon opportunity costs is called

A	the northwest corner rule
B	Vogel's approximation
C	Johanson's theorem
D	Flood's technique

Question 24

If in an assignment problem, number of rows is not equal to number of columns then __________

A	Problem is degenerate
B	Problem is unbalanced
C	It is a maximization problem
D	Optimal solution is not possible

Question 25

To find initial feasible solution of a transportation problem the method which starts allocation from the lowest cost is called ________ method

A	north west corner
B	least cost
C	south east corner
D	Vogel’s approximation

Once you are finished, click the button below. Any items you have not completed will be marked incorrect. Get Results

There are 25 questions to complete.

←

List

→

Return

Shaded items are complete.

1	2	3	4	5
6	7	8	9	10
11	12	13	14	15
16	17	18	19	20
21	22	23	24	25
End

Return

BACK SET 2

NEXT SET 4

Study Zone

MCQ » Operation Research Set 3

Operation Research Set 3

Important Links