675 + Mcqs in Operations Research Page 1 McqOptions

1.	The total time required to complete all the jobs in a job sequence problem is known as ______
A.	processing order
B.	idle time
C.	processing time
D.	elapsed time
Answer» E.

Discussion

2.	The shortest time in the PERT is called ______time
A.	expected
B.	pessimitic
C.	optimistic
D.	most likely
Answer» D. most likely

Discussion

3.	Pick the wrong relationship:
A.	interfering float = total float – free float
B.	total float =free float + independent float
C.	total float ≥ free float ≥ independent float
D.	free float = total float – head event slack
Answer» C. total float ≥ free float ≥ independent float

Discussion

4.	IF the Minimax are ( 10,18,16) and Maximin are (8,10,7). The saddle point is ___
A.	7
B.	10
C.	18
D.	8
Answer» C. 18

Discussion

5.	The longest path in the network diagram is called ____
A.	head path
B.	sub path
C.	critical path
D.	sub critical path
Answer» D. sub critical path

Discussion

6.	______method is used in Assignment Problem
A.	ncwr
B.	lcm
C.	vam
D.	hungarian
Answer» E.

Discussion

7.	When the solution is degenerate in transportation problem, we add a _
A.	dummy
B.	epsilon
C.	penalty
D.	regret
Answer» C. penalty

Discussion

8.	The outgoing variable row in the simplex table is called ____
A.	outgoing row
B.	key row
C.	basic row
D.	interchanging row
Answer» D. interchanging row

Discussion

9.	The region of feasible solution in LPP graphical method is called ____
A.	infeasible region
B.	unbounded region
C.	infinite region
D.	feasible region
Answer» E.

Discussion

10.	________are entities whose value is determined from the solution of LPP
A.	objective function
B.	decision variable
C.	constraints
D.	opportunity cost
Answer» B. decision variable

Discussion

11.	The second longest path in the network diagram is called Path.
A.	alternate
B.	feasible solution
C.	critical
D.	sub-critical
Answer» E.

Discussion

12.	Forward pass calculations are done to find occurrence times of events.
A.	exact
B.	earliest
C.	latest
D.	approximate
Answer» C. latest

Discussion

13.	When a particular assignment in the given problem is not possible or restricted as a condition, it is called a problem.
A.	degenerate
B.	prohibited
C.	infeasible
D.	unbalanced
Answer» C. infeasible

Discussion

14.	Operations Research techniques are in nature.
A.	qualitative
B.	quantitative
C.	judgmental
D.	subjective
Answer» C. judgmental

Discussion

15.	If 5y = 30, then the line is
A.	parallel to x axis
B.	parallel to y axis
C.	passes through the origin
D.	intersects both the axis
Answer» B. parallel to y axis

Discussion

16.	If there are or more decision variables in a LPP, SIMPLEX method is used.
A.	2
B.	3
C.	1
D.	4
Answer» C. 1

Discussion

17.	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.	saddle point
C.	main point
D.	equal point
Answer» C. main point

Discussion

18.	In a game, the alternatives or courses of action available to each player are called .
A.	choices
B.	strategies
C.	options
D.	actions
Answer» C. options

Discussion

19.	The outcome of the interaction of selected strategies of opponents in a game is called .
A.	income
B.	profit
C.	payoff
D.	gains
Answer» D. gains

Discussion

20.	The participants in a game are called .
A.	invitees
B.	players
C.	contestants
D.	clients
Answer» C. contestants

Discussion

21.	The total time required to complete all the jobs in a job sequencing problem is known as .
A.	processing time
B.	waiting time
C.	elapsed time
D.	idle time
Answer» D. idle time

Discussion

22.	The shortest possible completion time of an activity in PERT is called time.
A.	optimistic
B.	pessimistic
C.	expected
D.	most likely
Answer» B. pessimistic

Discussion

23.	Floats for critical activities will be always be .
A.	one
B.	zero
C.	highest
D.	equal to duration
Answer» C. highest

Discussion

24.	An activity whose start or end cannot be delayed without affecting total project completion time is called activity.
A.	dummy
B.	non-critical
C.	important
D.	critical
Answer» E.

Discussion

25.	If M + N – 1 = Number of allocations in transportation, it means . (Where ‘M’ is number of rows and ‘N’ is number of columns)
A.	there is no degeneracy
B.	degeneracy exists
C.	solution is optimum
D.	problem is balanced
Answer» B. degeneracy exists

Discussion

26.	When there is a degeneracy in the transportation problem, we add an imaginary allocation called in the solution.
A.	dummy
B.	penalty
C.	regret
D.	epsilon
Answer» E.

Discussion

27.	In a transportation problem, the method of penalties is called method.
A.	vogel’s approximat ion method
B.	nwcr
C.	lcm
D.	modi
Answer» B. nwcr

Discussion

28.	In simplex, a maximization problem is optimal when all Delta J, i.e. Cj – Zj values are .
A.	either zero or positive
B.	either zero or negative
C.	only positive
D.	only negative
Answer» C. only positive

Discussion

29.	The value of one extra unit of resource is called in simplex.
A.	unit price
B.	extra price
C.	retail price
D.	shadow price
Answer» E.

Discussion

30.	A resource which is partially utilized is called in simplex.
A.	null resource
B.	scarce resource
C.	abundant resource
D.	zero resource
Answer» D. zero resource

Discussion

31.	When the constraints are a mix of ‘less than’ and ‘greater than’ it is a problem having .
A.	multiple constraints
B.	infinite constraints
C.	infeasible constraints
D.	mixed constraints
Answer» E.

Discussion

32.	The outgoing variable row in the simplex algorithm is called .
A.	outgoing row
B.	key row
C.	interchanging row
D.	basic row
Answer» C. interchanging row

Discussion

33.	The region of feasible solution in LPP graphical method is called region
A.	infeasible
B.	infinite
C.	unbounded
D.	feasible
Answer» E.

Discussion

34.	The type of constraint which specifies maximum capacity of a resource is ‘or equal to’ constraint.
A.	less than
B.	greater than
C.	not greater than
D.	not less than
Answer» B. greater than

Discussion

35.	The time during which a machine remains waiting or vacant in sequencing problem is called time.
A.	processing
B.	waiting
C.	free
D.	idle
Answer» E.

Discussion

36.	In linear programming represents mathematical equation of the limitations imposed by the problem.
A.	objective function
B.	decision variables
C.	constraints
D.	opportunity cost
Answer» D. opportunity cost

Discussion

37.	The order in which machines are required for completing the jobs is called
A.	machines order
B.	job order
C.	processing order
D.	working order
Answer» D. working order

Discussion

38.	Backward pass calculations are done to find occurrence times of events.
A.	tentative
B.	definite
C.	latest
D.	earliest
Answer» D. earliest

Discussion

39.	The longest path in the network diagram is called path
A.	critical
B.	sub-critical
C.	best
D.	worst
Answer» B. sub-critical

Discussion

40.	The method used for solving an assignment problem is called method.
A.	vam
B.	nwcr
C.	modi
D.	hungarian
Answer» E.

Discussion

41.	When a maximization assignment problem is converted in minimization problem, the resulting matrix is called matrix.
A.	cost
B.	regret
C.	profit
D.	dummy
Answer» C. profit

Discussion

42.	If the number of rows and columns in an assignment problem are not equal than it is called problem.
A.	balanced
B.	unbalanced
C.	infeasible
D.	unbounded
Answer» C. infeasible

Discussion

43.	When the allocations of a transportation problem satisfy the rim condition (m + n – 1) the solution is called
A.	infeasible solution
B.	feasible solution
C.	non degenerate solution
D.	degenerate solution
Answer» D. degenerate solution

Discussion

44.	Which of the following considers difference between two least costs for each row and column while finding initial basic feasible solution in transportation?
A.	vam
B.	nwcr
C.	modi
D.	lcm
Answer» B. nwcr

Discussion

45.	When the total of allocations of a transportation problem match with supply and demand values, the solution is called solution.
A.	infeasible solution
B.	feasible solution
C.	optimum solution
D.	degenerate solution
Answer» C. optimum solution

Discussion

46.	To find initial feasible solution of a transportation problem the method which starts allocation from the lowest cost is called method
A.	vogel’s approximat ion method
B.	nwcr
C.	lcm
D.	modi
Answer» D. modi

Discussion

47.	A resource which is completely utilized is called in simplex
A.	null resource
B.	scarce resource
C.	abundant resource
D.	zero resource
Answer» C. abundant resource

Discussion

48.	In simplex, a minimization problem is optimal when all Delta J, i.e. Cj – Zj values are .
A.	either zero or positive
B.	either zero or negative
C.	only positive
D.	only negative
Answer» B. either zero or negative

Discussion

49.	The variable added to the LHS of a less than or equal to constraint to convert it into equality is called variable.
A.	surplus
B.	artificial
C.	slack
D.	additional
Answer» D. additional

Discussion

50.	The intersection value of key column and key row is called
A.	vital element
B.	important element
C.	basic element
D.	key element
Answer» E.

Discussion

Explore topic-wise MCQs in General Management.

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

The shortest time in the PERT is called ______time

Pick the wrong relationship:

IF the Minimax are ( 10,18,16) and Maximin are (8,10,7). The saddle point is ___

The longest path in the network diagram is called ____

______method is used in Assignment Problem

When the solution is degenerate in transportation problem, we add a _

The outgoing variable row in the simplex table is called ____

The region of feasible solution in LPP graphical method is called ____

________are entities whose value is determined from the solution of LPP

The second longest path in the network diagram is called Path.

Forward pass calculations are done to find occurrence times of events.

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

Operations Research techniques are in nature.

If 5y = 30, then the line is

If there are or more decision variables in a LPP, SIMPLEX method is used.

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

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

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

The participants in a game are called .

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

The shortest possible completion time of an activity in PERT is called time.

Floats for critical activities will be always be .

An activity whose start or end cannot be delayed without affecting total project completion time is called activity.

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

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

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

In simplex, a maximization problem is optimal when all Delta J, i.e. Cj – Zj values are .

The value of one extra unit of resource is called in simplex.

A resource which is partially utilized is called in simplex.

When the constraints are a mix of ‘less than’ and ‘greater than’ it is a problem having .

The outgoing variable row in the simplex algorithm is called .

The region of feasible solution in LPP graphical method is called region

The type of constraint which specifies maximum capacity of a resource is ‘or equal to’ constraint.

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

In linear programming represents mathematical equation of the limitations imposed by the problem.

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

Backward pass calculations are done to find occurrence times of events.

The longest path in the network diagram is called path

The method used for solving an assignment problem is called method.

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

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

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

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

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

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

A resource which is completely utilized is called in simplex

In simplex, a minimization problem is optimal when all Delta J, i.e. Cj – Zj values are .

The variable added to the LHS of a less than or equal to constraint to convert it into equality is called variable.

The intersection value of key column and key row is called