Operation Research Set 4

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

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

Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1

In case of an unbalanced problem, shipping cost coefficients of ______ are assigned to each created dummy factory or warehouse

A	very high positive cost
B	very high negative costs
C	10
D	zero

Question 2

The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are ___

A	m+n
B	m*n
C	m+n-1
D	m+n+1

Question 3

During an iteration while moving from one solution to the next, degeneracy may occur when___

A	The closed path indicates a diagonal move
B	Two or more occupied cells are on the closed pathbut neither of them represents a corner of the path
C	Two or more occupied cells on the closed path with minus sign are tied for lowest circled value
D	Either of the above

Question 4

The outcome of the interaction of selected strategies of opponents in a game is called __________

A	income
B	profit
C	payoff
D	gains

Question 5

The total time required to complete all the jobs in a job sequencing problem is known as ___________

A	elapsed
B	idle
C	processing
D	average

Question 6

The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that____

A	The solution be optimal
B	he rim conditions are satisfied
C	The solution not be degenerate
D	All of the above

Question 7

Which of the following is a method for improving an initial solution in a transportation problem?

A	northwest-corner
B	intuitive lowest-cost
C	southeast-corner rule
D	stepping-stone

Question 8

The time between the starting of the first job and completion of the last job in sequencing problems is called __________

A	total time
B	assignment time
C	elapsed time
D	idle time

Question 9

In a game, the alternatives or courses of action available to each player are called __________

A	options
B	choices
C	actions
D	strategies

Question 10

Which of the following is NOT needed to use the transportation model?

A	the cost of shipping one unit from each origin to each destination
B	the destination points and the demand per period at each
C	the origin points and the capacity or supply per period at each
D	degeneracy

Question 11

The degeneracy in the transportation problem indicates that

A	Dummy allocation(s) needs to be added
B	The problem has no feasible solution
C	The multiple optimal solution exist
D	a & b but not c

Question 12

The various alternatives or courses of actions available to each player in a game are called as __________

A	saddle points
B	strategies
C	pay-off
D	‘n’

Question 13

The participants in a game are called __________

A	clients
B	members
C	customers
D	players

Question 14

A set of feasible solution to a Linear Programming Problem is ______________

A	convex
B	polygon
C	triangle
D	bold

Question 15

The time during which a machine remains waiting or vacant in sequencing problem is called __________ time

A	processing order
B	waiting
C	idle
D	free

Question 16

The dummy source or destination in a transportation problem is added to _____

A	Satisfy rim conditions
B	Prevent solution from becoming degenerate
C	Ensure that total cost does not exceed a limit
D	None of the above

Question 17

If an opportunity cost value is used for an unused cell to test optimality, it should be____

A	Equal to zero
B	Most negative number
C	Most positive number
D	Any value

Question 18

An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unusedroute of transportation is____

A	Positive & greater than zero
B	Positive with at least one equal to zero
C	Negative with at least one equal to zero
D	None of the above

Question 19

The time required by each job on each machine is called __________ time

A	elapsed time
B	idle
C	processing
D	average

Question 20

The order in which machines are required for completing the jobs is called __________

A	completion sequence
B	job sequence
C	processing order
D	job order

Question 21

The purpose of a dummy source or dummy destination in a transportation problem is to___

A	prevent the solution from becoming degenerate
B	obtain a balance between total supply and total demand
C	make certain that the total cost does not exceed some specified figure
D	provide a means of representing a dummy problem

Question 22

In sequencing problem, the order of completion of jobs is called __________

A	completion sequence
B	job sequence
C	processing
D	job order

Question 23

A situation in a game where, in the payoff matrix, maximin of row is equal to minimax of column is called __________

A	centre point
B	main point
C	saddle point
D	equal point

Question 24

A game having more than two players is called __________ game

A	multi-person
B	many person
C	n-person
D	unknown person

Question 25

The occurrence of degeneracy while solving a transportation problem means that____

A	Total supply equals total demand
B	The solution so obtained is not feasible
C	The few allocations become negative
D	None of the above

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 3

Study Zone

MCQ » Operation Research Set 4

Operation Research Set 4

Important Links