MCQS FOR END SEMESTER EXAMINATIONS

UNIT I

Operations research is the application of ____________ methods to arrive at the optimal

solutions to the problems.

Economical

Scientific

Artistic

Rational

2. Operations Research (OR) , which is a very powerful tool for ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

a) Research

b) Decision – Making

c) Operations

d) None of the above

3. Operations research is based upon collected information, knowledge and advanced

study of various factors impacting a particular operation. This leads to more informed
----------- --------------------------.

A. Management processes

B. Decision making

C. Procedures

4. OR has a characteristics that it is done by a team of

A. Scientists

B. Mathematicians

C. Academics

D. All of the above

5. What have been constructed from OR problems an methods for solving the models that
are available in many cases?

A. Scientific Models

B. Algorithms

C. Mathematical Models

D. None of the above

6. What is the objective function in linear programming problems?

A. A constraint for available resource

B. An objective for research and development of a company

C. A linear function in an optimization problem

D. A set of non-negativity conditions

7. Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐

a) Vector b) Key column c) Key Raw d) None of the above

8. Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is
called its ‐‐‐‐‐‐‐‐

a) Unbounded solution b) Optimal solution c) Feasible solution d) Both A and B

9. How many methods are there to solve LPP?

a) Three b) Two c) Four d) None of the above

10. The region containing all the solutions of an inequality is called solution region.
a) True
b) False

11. y<-2 involves region are____________

a) above dotted line y=-2
b) below dotted line y=-2
c) above complete line y=-2
d) below complete line y=-2

12.
 13.

14.

15.

UNIT 2

1. Optimal solution is a feasible solution (not necessarily basic ) which minimizes the
a) Time taken b) Partial cost c) Total cost d) None of the above
2. A given TP is said to be unbalanced, if the total supply is not equal to the total
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ a) Optimization
b) Demand
c) Cost
d) None of the above
3. If the total supply is less than the total demand, a dummy source (row) is included in
the cost matrix with ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Dummy Demand b) Dummy Supply c) Zero Cost d) Both A and B
4. A feasible solution is called a basic feasible solution if the number of non‐negative
allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) m‐n+1 b) m‐n‐1 c) m+n‐1 d) None of the above
5. According to transportation problem number of basic cells will be exactly
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a) m+n‐0 b) n+m‐1 c) m+n‐1 d) None of the above
6. VAM stands for ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Vogeal’s Approximation Method b) Vogel’s Approximate Method c) Vangel’s
Approximation Method d) Vogel’s Approximation Method
7. To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐
a) LPP b) VAM c) MODI Method d) Rim
8. Any feasible solution to a transportation problem containing m origins and n
destinations is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
a) Independent b) Degenerate c) Non‐degenerate d) Both A and B
9. The solution of any transportation problem is obtained in how many stages?
a) Five b) Four c) Three d) Two
10. If demand is lesser than supply then dummy demand node is added to make it a
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ a) Simple problem b) Balanced problem c) Transportation problem
d) None of the above
 11. For maximization in TP , the objective is to maximize the total ‐‐‐‐‐‐‐‐‐‐
a) Solution b) Profit Matrix c) Profit d) None of the above
12. What do we apply in order to determine the optimum solution ?
a) LPP b) VAM c) MODI Method d) None of the above
13. In a TP , if the number of non‐negative independent allocation is ‐‐‐‐‐‐‐‐‐‐‐‐ than m+n‐
1.
a) Equivalent b) Greater c) Less d) None of the above
14. Hungarian Method is used to solve
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b
15. For solving an assignment problem, which method is used?
a) Hungarian b) American c) German
d) Both are incorrect
16. To make an unbalanced assignment problem balanced, what are added with all entries
as zeroes?
a) Dummy rows b) Dummy columns c) Both A and B d) Dummy entries

UNIT 3: Sequencing Problem

1.

UNIT 4

1. A two-person zero-sum game means that the

the sum of losses to one player is equal to the sum of gains to other

the sum of losses to one player is not equal to the sum of gains to other

no any player gains or losses

none of these

2. Game theory models are classified by the

(a) number of players

(b) sum of all payoffs
(c) number of strategies
(d) all of these

3. A game is said to be fair if

(a) both upper and lower values of the game are the same and zero
(b) upper and lower values of the game are not equal
(c) upper value is more than the lower value of the game
(d) none of these

4. What happens when maximin and minimax values of the game are same?

(a) no solution exists

(b) solution is mixed
(c) saddle point exists
(d) none of these

5. A mixed strategy game can be solved by

(a) algebraic method

(b) matrix method
(c) graphical method
(d) all of these

6. The size of the payoff matrix of a game can be reduced by using the principle of

(a) game inversion

(b) rotation reduction
(c) dominance
(d) game transpose
7. The payoff value for which each player in a game always selects the same strategy is called the

(a) saddle point

(b) equilibrium point
(c) both (a) and (b)
(d) none of these

8. Games which involve more than two players are called

(a) conflicting games

(b) negotiable games
(c) N-person games
(d) all of these

9. When the sum of gains of one player is equal to the sum of losses to another player in a
game, this situation is known as

(a) biased game

(b) zero-sum game
(c) fair game
(d) all of these

10. When no saddle point is found in a payoff matrix of a game, the value of the game is then
found by

(a) reducing the size of the game to apply the algebraic method
(b) solving any one 2x2 subgame
(c) finding the average of all the values of the payoff matrix
(d) none of these

11. A saddle point exists when

(a) maximin value = maximax value

(b) minimax value = minimum value
 (c) minimax value = maximin value
(d) none of these

12. In a pure strategy game

(a) any strategy may be selected arbitrarily

(b) a particular strategy is selected by each player
(c) both players select their optimal strategy
(d) none of these
13. Linear programming method should be used to determine the value of the game when the
size of the payoff matrix is

(a) 2 x 2
(b) 3 x 4
(c) m x 2
(d) 2 x n
14. Game theory is the study of

(a) selecting optimal strategies

(b) resolving conflict between players
(c) giving equal outcome to participants
(d) none of these
15. If the value of the game is zero, then the game is known as:

(a) Fair strategy

(b) Pure strategy
(c) Pure game
(d) Mixed strategy
16. The games with saddle points are

(a) Probabilistic in nature,

(b) Normative in nature
(c) Stochastic in nature,
(d) Deterministic in nature.
17. If the losses of player A are the gins of the player B, then the game is known as

(a) Fair game

(b) Unfair game
(c) Non- a zero-sum game
(d) Zero-sum game

UNIT 5 Network Analysis

1.What is PERT analysis based on?

A. Optimistic time
B. Pessimistic time
C. Most likely time
D. All of the above
Answer: D

2. Which of the options is not a notable challenge while scheduling a project?

A. Deadlines exist
B. Independent activities
C. Too many workers may be required
D. Costly delay
Answer: B
3. What is the particular task performance in CPM known as?
A. Dummy
B. Event
C. Activity
D. Contract
Answer: C

4. What is the earliest start time rule?

A. It compares the activity’s starting time for an activity successor.
B. It compares the activity’s end time for an activity predecessor.
C. It directs when a project can start.
D. It regulates when a project must begin.
Answer: B

5. What is a critical path?

A. It is a path that operates from the starting node to the end node.
B. It is a mixture of all the paths
C. It is the longest path
D. It is the shortest path
Answer: C

6. What is the completion of a CPM network diagram activity commonly known as?
A. Connector
B. Event
C. Node
D. All of the above
Answer: D

7. Activities A, B, and C are the immediate predecessors for Y activity. If the earliest
finishing time for the three activities are 12, 15, and 10, then what will be the earliest
starting time for Y?
A. 10
B. 15
C. 12
D. Cannot be determined
Answer: B

8.Activities P, Q, and R instantly follow activity M, and their current starting times are
12, 19, and 10. So, what is the latest finishing time for activity M?
A. 11
B. 10
C. 18
D. Cannot be determined
Answer: A

9.Activity in a network diagram is represented by?

A. Rectangles
B. Arrows
C. Squares
D. Circles
Answer: B

10.What happens when a project is scheduled by CPM?

A. A project is divided into various activities
B. Required time for each activity is established
C. A sequence of various activities is made according to their importance
D. All of the above
Answer: D
11. The full form of PERT is ___________
a) Program Evaluation and Rate Technology
b) Program Evaluation and Robot Technique
c) Program Evaluation and Robot Technology
d) Program Evaluation and Review Technique
12. The full form of CPM is ___________
a) Critical Path Method
b) Control Path Method
c) Critical Plan Management
d) Control Path Management
13. In a network, a critical path is the time-wise shortest path.
a) True
b) False
14. The difference between the maximum time available and the actual time needed to
perform an activity is known as _________
a) Free float
b) Independent float
c) Total float
d) Half float

15. What is the definition of a critical path?

It’s a path that connects the starting and ending nodes.

It combines all of the paths.

It is the shortest route.

It is the most direct route.

16. The quickest time in which a task may be completed under perfect conditions is
referred to as
 1. The most pessimistic time estimate
2. The most optimistic time estimate
3. The expected time estimate
4. The most likely time estimate

17. The goal of network analysis is to

1. reduce the overall project duration
2. reduce the entire project cost
3. keep production delays, interruptions, and conflicts to a minimum
4. extend the project’s entire time

18. _____________ is a type of activity that does not require any resources or time.
1. there is no activity
2. a dummy action
3. the preceding activity
4. unique action

http://nevillewadia.com/wp-content/uploads/2021/04/Operation-Research-MCQs1.pdf