MLR Institute of Technology

Dundigal, Hyderabad - 500 043

MECHANICAL ENGINEERING

Unit Wise Objective Questions

Course Title Operations Research

Course Code 57022
Regulation R09
Course Structure Lectures Tutorials Practicals Credits
4 1 - 4
Course Coordinator Ms A.Nalini Deepthi, Assistant Professor, Mr.K.Chinna Maddaiah, Assistant Professor

UNIT -1

1. In simplex table, the value of Z j Cj for basic variables will be [ C ] (SEP-2011 JNTU)
(A) Negative (B) positive (C) zero (D) unity

2. If a dual has 3 variables in 2 constraints, its primal will have [C ] (SEP-2011 JNTU)
(A) 3 variables and 2 constraints (B) 3 conditions and two variables
(C) 2 variables and 3 constraints (D) 2 conditions and 3 variables

3. The model parameters of linear programming model are [ C] (SEP-2011 JNTU)

A) Objective Coefficient B) Constraint coefficient C) A&B D)None

4. When the value of decision variables in LPP is permitted to increase infinitely without violating feasibility
condition, then the solution is said to be [A ] (Sep 2010JNTU)

A) Unbounded B)Bounded C) No Solution D) Multiple Solution

5. While solving LPP problem using simplex method, the identity matrix is always a matrix [ B]

A) Rectangular B) square C) either A or B D) neither A or B (Sep 2010JNTU)

6. In the two phase method, the solution of the LPP is completed in _____phases. [C]

A) Four B) three C) two D) one (Sep 2010JNTU)

7. While solving LPP in certain cases some basic variables may also have zero values. This situation is
called__________. [C] (Sep 2010JNTU)

A) optimal B) Multiple Solution C) Degenaracy D) None

8. An O R model represents a system, but does not physically resemble the components of the system
and after attaining solution; it is re-interpreted in terms of original system. This OR model can be named as [B]
(Sep 2010 JNTU)

(a) Iconic model (b) Analogue model (c) Symbolic model (d) Normative model

9. C Z value for basic variable in a simplex tableau will be [B] (Sep 2010 JNTU)
j j
 (a) any positive value (b) zero (c) negative value (d) unit

10.A feasible solution to the linear programming problem should: (APPSC 2008)
(a) satisfy the problem constraint (b) optimize the objective function (c) satisfy the problem constraint and
non negativity restrictions(d) satisfy non negativity restrictions only.

UNIT II

1. There will be no solution in [ B] (SEP-2011 JNTU)

(A) Unbounded solutions (B) Infeasible solutions (C) multiple solutions (D) unique solutions

2. In a T.P. Matrix of the order 6 X 5, the degeneracy is found if number of allocated cells are
[C] (SEP-2011 JNTU)
(A) 11 (B) 10 (C) 9 (D) 8

3. An assignment problem is said to be balanced if [ A] (SEP-2011 JNTU)

(A) no. of rows =no. of columns (B) no. of allocated cells=no. of rows + no. of columns - 1
(C) Total supply=total demand (D) no. of zero in the cost matrix is equal to the order

4. Penalties are used in [B ] (SEP-2011 JNTU)

(A) Two phase method (B) Big M method (C) dual simplex (D) all the above

5. A loop in transportation optimization should have _______________ at the corners. [D ]

(A) All allocated cells (B) all unoccupied cells (SEP-2011 JNTU)
(C) at least one occupied cell (D)only one unoccupied and all other occupied cells

6. The transportation model is treated as balanced if [A ] (SEP-2011 JNTU)

A) Demand= Supply B) Demand >Supply C)Demand < SupplyD)NONE

7. In corner point solution method the value of objective function is completed at which points of
feasible solutions space [B ] (SEP-2011 JNTU)
A) Middle Point B) Corner Point C)None D) A&B

8. In transportation problems optimality test can be carried out by [C ] (SEP-2011 JNTU)

A) Stepping Stone Method B) MODI Method C)A&B D)Row Minima Method.

9. Hungarian Method Deals With [A ] (SEP-2011 JNTU)

A) Assignment model B)Transportation model C)Graphical model D)None

10. If the distance (or time or Cost) Between Every pair of cities is independent of travelling direction the problems
is said to be [ B] (SEP-2011 JNTU)
A) Asymmetrical B) Symmetrical C) A&B. D)None

UNIT - III

1. The following rule is used in sequencing [B] (SEP-2011 JNTU)

(A) Hungarian (B) Johnsons (C) Monte-Carlo (D) VAM

2. When the money value is changing with time @20%,the discount factor for 2nd year
(A) 1 (B) 0.833 (C) 0.909 (D) zero [B ] (SEP-2011 JNTU)
3. In sequencing an optimal path is one that minimizes [ B] (SEP-2011 JNTU)
A) Elapsed time B) Idle time C) Processing Time D)None.

4. The number of possible sequences (theoretical) which minimize the total elapsed time for 3 jobs to be
performed one at a time on each of 3 machines is [ D] (Sep 2010 JNTU)
A) 6 B) 9 C) 8 D) 216

5. The time interval between starting the first job and completing the last job including the idle time in a
particular order by the given set of machines is called [B](Sep 2010 JNTU)
A) Idle Time B) Total elapsed time C) Machining Time D) NO Solution

6. If two jobs J and J have same process times in both series we prefer [D] (Sep 2010 JNTU)
1 2
(a) J (b) J (c) J and J (d) J or J
1 2 1 2 1 2

7. The replacement policy that is imposed on an item irrespective of its failure (i.e. it is replaced even though it has not
failed) is [ B] (Sep 2010 JNTU)
(a) Individual replacement (b) Group replacement
(c) If money value is constant (d) If money value varies with time

st nd
8. Jobs A to E have process times as 12,4,20,14 and 22 on 1 Machine and 6,14, 16, 18 and 10 on 2 Machine, the optimal
sequence is [D ] (Sep 2010 JNTU)
(a) CEABD (b) AECDB (c) BCDEA (d) BDCEA

9. In replacement analysis the maintenance cost is the function of [B ] (Sep 2010 JNTU)
(a) Present value (b) Time (c) Maintenance policy (d) Resale value

UNIT - IV

1. If the gain of a player is loss of another player then the game is called [A] (SEP-2011 JNTU)
(A) Fair game (B) unfair game (C) zero sum game (D) non zero sum game

2. A plan of action which is changed while the game is in progress is called [B ] (SEP-2011 JNTU)
A) Pure strategy B) Mixed Strategy C) operational Strategy D) None

3. A game is said to Zero sum game when sum of players gain and loss are equal to [ A]
A) 0 B) 1 C) D)< 0 (SEP-2011JNTU)

4. A game is set to be fair game when the value of game [B ] (SEP-2011 JNTU)
A)1 B) 0 C) >1 D)None

5. If saddle point does not exist, [ B] (Sep-2010-

JNTU)
(a) It is deterministic game (b) Mixed strategies are used
(c) Maximin - minimax criteria are used (d) It is a fair game

UNIT V

1. A customer who is already in queue will leave the queue in anticipating of larger waiting time
a) Jockeying b) Reneging c) Boarding d) Balking [ B] (OCT/NOV 2012 JNTU)
2. A Doctor rushing to an emergency case, leaving his regular service is said to be [ A]
a) Pre-emptive Queue discipline b) Non Pre-emptive Queue discipline
c) Reneging d) Balking (OCT/NOV 2012 JNTU)

3. A Poisson arrival, exponential service by single server to limited queue selected randomly is represented by [C ]
a) (M/M/C) : (GD//) b) (M/M/1) : (GD//)
c) (M/M/1) : (GD/N/N) d) (M/M/C) : (GD/N/N) (OCT/NOV 2012 JNTU)

4. Waiting line problems arise either because [C ] (DEC 2011 JNTU)

A) Too much demand B) Too less demand C) A & B, D) None

5. A Queuing model is called multiserver model if the system has number of parallel channels each with one
server [C ] (DEC 2011 JNTU)
A) 1 B) 0 C) > 1 D) None

6. Stock level at which fresh order should be placed is known as [C ] (DEC 2011 JNTU)
A) Out of Stock B) Surplus C) Re Order Level D) None

7. A steady state can exist in a queue if [ C] (DEC 2011 JNTU)

(A) > (B) < (C) (D)

8. The cost of providing service in a queuing system decreases with [ D]

(A) decreased average waiting time in the queue (B) decreased arrival rate
(C) Increased arrival rate (D) none of the above (DEC 2011 JNTU)

9. The unit of traffic intensity is [ C]

(A) Poisson (B) Markov (C) Erlang (D) Kendall (DEC 2011 JNTU)

10. Which of the following has 100% efficiency [ A] (DEC 2011 JNTU)
(A) Arrival rate=service rate (B) arrival rate> service rate
(C) Arrival rate<service rate (D) none

UNIT -VI

1. The formula for EOQ when shortage is allowed and constant demand and instantaneous replenishment is given by
[B ]
a) 02CCDC b) 02CDCCC c) 02CDCCC d) 02CDCCC (OCT/NOV 2012 JNTU)

2. The most suitable analysis for spare parts in engines and machinery, which are vital [C ]
a) A B C Analysis b) F S N Analysis c) V E D Analysis d) None (OCT/NOV 2012 JNTU)

3. The inventory system design for petrol tank of a two wheeler is [B] (OCT/NOV 2012 JNTU)
a) P-System b) Q-System c) Stochastic System d) Poisson Model

4. The material stored to safe guard, the production chain in the event of machine breakdown[B ]
a) Buffer stock b) De-coupling Inventory (OCT/NOV 2012 JNTU)
c) Lost wise Inventory d) None
5. ABC Analysis is known as [D ] (DEC 2011 JNTU)
A) Always Better Control B) Control by Importance and exception C) Proportional Value D) All

6. What are commonly used periodic review system [ C] (DEC 2011 JNTU)
A) Fixed order system B) SS System C) Fixed order & SS System D) Q & Two bin System

7. Taxes and insurance included in [D ] (DEC 2011 JNTU)

(A) Ordering cost (B) shortage cost (C) purchase cost (D) carrying cost
8. If shortage cost is infinity [B ] (DEC 2011 JNTU)
(A) Order cost is zero (B) no shortages are allowed
(C) No inventory carrying is allowed (D) purchase cost=carrying cost

9. In the case of inventory model with shortages, the optimal amount of back order units [ ]
(a) EOQ/2 (b) 10% of EOQ (c) EOQ. sccCCC+ (d) EOQ. scsCCC+ (NOV 2010-JNTU)

10. If the total investment in stock is limited, the best order quantity for each item is [ ]
(a) equal to EOQ (b) greater than EOQ (c) less than EOQ (d) either greater or less than EOQ
(NOV 2010-JNTU

UNIT -VII

1. The principle of optimality is given by [C ]

a) Kimball b) Dantzig c) Richard Bellman d) None (OCT/NOV 2012 JNTU)

2. An LPP solved by using DPP method assuming the variables as [C]

a) Recursion b) Return Function c) Stages d) None (OCT/NOV 2012 JNTU)

3. A System in which state variables change only at points in time is known as [ ]

A) Discrete B) Continuous C) Exponential D) None (DEC 2011 JNTU)

4. A probabilistic dynamic programming (PDP) decision makers goal is to ___the expected reward over a given time
horizon [ A] (DEC 2011 JNTU)
A) Maximize B) Minimize C) A & B, D) None

5. A periodic review model in which each products demand is known at beginning of the problem is [ ] A) Dynamic
Lot Size B) Static Lot Size C) A&B D) None (DEC 2011 JNTU)

6. An LPP solved by using DPP method assumes the variables as [ B]

(A) States (B) stages (C) recursions (D) return functions (DEC 2011 JNTU)

7. The optimality principle (to solve DPP) is given by [C ] (DEC 2011 JNTU)
(A) Dantzig (B) Richard Brown (C) Bellman (D)Kimball

8. How many objective functions will a DPP have? [ ] (NOV 2010-JNTU)

(a) no objective function (b) equal to that of no. of stages
(c) only one objective functions (d) infinite objective functions

9. The mathematical technique of optimizing such a sequence of inter related decisions over a period of time is
called -------------programming [ ] (NOV 2010-JNTU)
(a) Linear (b) non linear c) Dynamic d) stochastic

UNIT VIII

1. Observance of the behavior of the real system under as many operations and configurations as possible to get an
insight is a called [B] (OCT/NOV 2012 JNTU)
a) Computer simulation b) identity simulation
c) Laboratory simulation d) none

2. Simulation model which represent a system at particular point in time is known as [A]
A) Static B) Dynamic C) A&B D) None (DEC 2011 JNTU)

3. A markov Decission process is described by how many types of Information [D ]

A) 1 B) 2 C) 3 D) 4 (DEC 2011 JNTU)

4. Which of the following has 100% efficiency [ A] (DEC 2011 JNTU)

(A) Arrival rate=service rate (B) arrival rate> service rate
(C) Arrival rate<service rate (D) none

5. Simulation where changes in the state of the system occur instantaneously at random points in a given time, is
called [ ] (NOV 2010-JNTU)
(a) Continuous simulation (b) Discrete event simulation
(c) Deterministic simulation (d) Random number

10. In the word "Monte Carlo Simulation", Monte Carlo is the name of [ ] (NOV 2010-JNTU)
(a) Scientist (b) Car (c) Place (d) Mountain