These are sample MCQs to indicate pattern, may or

may not appear in examination.

Mahatma Education Society’s

Pillai HOC College of Engineering and Technology

Program: BE Mechanical Engineering

Curriculum Scheme: Rev 2012
Examination: Final Year Semester VII
Course Code: MEE7019 and Course Name: Operations Research
Time: 1 hour Max. Marks: 50
Note to the students:- All the Questions are compulsory and carry equal marks .

Q1. Which one of the following is a part of every game theory model?
Option A: Payoffs
Option B: Players
Option C: Strategies
Option D: Probabilities

Q2. The feasible solution of a L.P.P. belongs to

Option A: Only in the first quadrant
Option B: First and third quadrant
Option C: Second quadrant
Option D: First and second quadrant

Q3. The assignment algorithm was developed by ______________ method.

Option A: TRAVELING SALES MAN
Option B: VOGELS
Option C: MODI
Option D: HUNGARIAN

Q4. When all the players of the game follow their optimal strategies, then the expected
pay off of the game is called___________
Option A: Equal to game
Option B: Gain of the game
Option C: Loss of the game
Option D: Value of the game

Q5. Operations research is the application of ____________methods to arrive at the optimal

Solutions to the problems.
Option A: Scientific
Option B: Economical
Option C: Artistic
Option D: Theoretical

Q6. A matrix which shows the gains and losses resulting from moves and counter moves
 is Called ____________
Option A: Profit matrix
Option B: Cost matrix
Option C: Pay off matrix
Option D: Loss Matrix

Q7. Two jobs through m machine problems can be solved by

Option A: Branch and bound method
Option B: Johnson method
Option C: Hungarian method
Option D: Graphical method

Q8. Re-ordering level is calculated as

Option A: Maximum consumption rate x Maximum re-order period
Option B: Minimum consumption rate x Minimum re-order period
Option C: Maximum consumption rate x Minimum re-order period
Option D: Minimum consumption rate x Maximum re-order period

Q9. In Simplex method, the slack, the surplus and artificial variables are restricted to be
Option A: Divided
Option B: Negative
Option C: Non-negative
Option D: Multiple values

Q10. The purpose of the stepping-stone method is to

Option A: Develop the initial solution to the transportation problem.
Option B: Assist one in moving from an initial feasible solution to the optimal solution.
Option C: Determine whether a given solution is feasible or not.
Option D: Identify the relevant costs in a transportation problem.

Q11. What is a two-bin system?

Option A: A system in which orders are placed when only one complete bin of stock is
remaining.
Option B: A system in which suppliers deliver two bins at a time
Option C: A system in which everything is split between two storage bins.
Option D: A system in which two full bins of an item are always held in stock

Q12. In converting an equal constraint for use in a simplex table, we must add
Option A: A surplus and an artificial variable
Option B: A surplus variable
Option C: A slack variable
Option D: An artificial variable

Q13. If purchase order lead time is 35 minutes and number of units sold per time is 400
units then reorder point will be
Option A: 14000 units
Option B: 14500 units
Option C: 15000 units
Option D: 15500 units

Q14. Which of the following is/are property/properties of a dynamic programming

problem?
Option A: Optimal substructure
Option B: Overlapping sub problems
Option C: Greedy approach
Option D: Both optimal substructure and overlapping sub problems

Q15. In dynamic programming, the technique of storing the previously calculated values
is called ___________
Option A: Saving value property
Option B: Storing value property
Option C: Memorization
Option D: Mapping

Q16. The objective function and constraints are functions of two types of variables,
_______________ Variables and ____________ variables.
Option A: Controllable and uncontrollable
Option B: Positive and negative
Option C: Comfortable and uncomfortable
Option D: Strong and weak

Q17. _________ is an important Operations Research Technique to analyses the queuing

behavior.
Option A: Game theory
Option B: Waiting line theory
Option C: Decision theory
Option D: Simulation

Q18. Which of the following is NOT needed to use the transportation model?
Option A: The cost of shipping one unit from each origin to each destination
Option B: The destination points and the demand per period at each
Option C: The origin points and the capacity or supply per period at each
Option D: Degeneracy

Q19. Which statement characterizes standard form of a linear programming problem?

Option A: Constraints are given by inequalities of any type
Option B: Constraints are given by a set of linear equations
Option C: Constraints are given only by inequalities of >= type
Option D: Constraints are given only by inequalities of <= type

Q20. An example of purchasing costs include

Option A: Incoming freight
Option B: Storage costs
Option C: Insurance
Option D: Spoilage

Q21. If an average inventory is 2000 units and annual relevant carrying cost of each unit
is $5 then annual relevant carrying cost will be
Option A: $5,000
Option B: $4,500
Option C: $5,500
Option D: $6,000

Q22. In Degenerate solution value of objective function _____________.

Option A: Increases infinitely
Option B: Basic variables are nonzero
Option C: Decreases infinitely
Option D: One or more basic variables are zero

Q23. Activities related to coordinating, controlling and planning activities of flow of

inventory are classified as
Option A: Decisional management
Option B: Throughput management
Option C: Inventory management
Option D: Manufacturing management

Q24. Which of the following criterion is not used for decision making under uncertainty?
Option A: Maximin
Option B: Minimize expected loss
Option C: Minimax
Option D: Maximax

Q25. The difference between the Big M Method and two phase methods are
Option A: Entries in the top row, corresponding to the co-efficient of the objective function,
are not same
Option B: The row entries in the corresponding to the constraints in various iterations /
tables are same
Option C: The solution obtained by both method is same
Option D: The solution is not obtained by both method is same