SATISH PRADHAN DNYANASADHANA COLLEGE

Department of BMS SAMPLE MCQ QUESTIONS Subject: Operations Research

Sr. Correct
No Question (a) (b) (c) (d) Answer
Operations Research Models in which values of all variables and all
1 possible outcomes are known with certainty are called _________ models. Physical Symbolic Deterministic Probabilistic (c)
Operations Research Models in which some or all variables are random in
2 nature are called____________ models. Physical Symbolic Deterministic Probabilistic (d)
Decision Theory
Assignment &
_________and________ are techniques applied in project management. CPM and & Inventory
Transportation
3 PERT Game Theory Models (a)
_______ are the entities whose values are to be determined from the Objective Decision
4 solution of the LPP. function Variables Constraints opportunity cost (b)
Objective Decision
5 _______ specifies the objective or goal of solving the LPP. function Variables Constraints opportunity cost (a)
Objective
6 __________are the restrictions or limitations imposed on the LPP. function Variables Constraints Profit (c)
When it is not possible to find solution in LPP, it is called as ___________
Infeasible Unbounded
7 solution Improper Unknown (a)
less than or greater than or
8 In case of a ‘_______’ constraint, the feasible region is a straight line. equal to equal to Mixed equal to (d)
9 In linear programming, unbounded solution means ______ solution. Infeasible Infinite Unique Degenerate (b)
Key Incoming Important Variable
10 The incoming variable column in the simplex algorithm is called _______. Column Column Column Column (a)
vital important
11 The intersection value of key column and key row is called _______ element element basic element key element (d)
The variable added to the LHS of a less than or equal to constraint to
12 convert it into equality is called _________ variable. Surplus artificial slack additional (c)
null scarce abundant
13 A resource which is completely utilized is called_________ in simplex resource resource resource zero resource (b)
In simplex, a minimization problem is optimal when all Delta J, i.e. either zero either zero or
14 Cj – Zj values are _______. or positive negative only positive only negative (a)
Vogel’s
To find initial feasible solution of a transportation problem the method Approximat
15 which starts allocation from the lowest cost is called _____ method ion Method NWCR LCM MODI (c)

1
 When the total of allocations of a transportation problem match with Infeasible Feasible Optimum Degenerate
16 supply and demand values, the solution is called _____ solution. solution solution solution solution (b)
Non
When the allocations of a transportation problem satisfy the rim condition Infeasible Feasible Degenerate Degenerate
17 (m + n – 1) the solution is called ________ solution solution solution solution (c)
Which of the following considers difference between two least costs for
each row and column while finding initial basic feasible solution in
18 transportation? VAM NWCR MODI LCM (a)
If the number of rows and columns in an assignment problem are not
19 equal than it is called ________ problem. Balanced Unbalanced Infeasible Unbounded (b)
The method used for solving an assignment problem is called _______
20 method. VAM NWCR MODI Hungarian (d)
When a maximization assignment problem is converted in minimization
21 problem, the resulting matrix is called ______ matrix. Cost Regret Profit Dummy (b)
22 The longest path in the network diagram is called __________ path Critical Sub-critical Best worst (a)
Backward pass calculations are done to find ________occurrence times of
23 events. tentative definite latest earliest (c)
Machines Processing
The order in which machines are required for completing the jobs is called
24 order Job order order working order (c)
The time during which a machine remains waiting or vacant in sequencing
25 problem is called _____ time. Processing Waiting Free Idle (d)
In linear programming _______ represents mathematical equation of the Objective Decision
26 limitations imposed by the problem. function Variables Constraints opportunity cost (c)
The type of constraint which specifies maximum capacity of a resource is Not Greater
27 __________ ‘or equal to’ constraint. Less than Greater than than Not less than (a)
The region of feasible solution in LPP graphical method is called
28 __________region Infeasible Infinite Unbounded feasible (d)
When the constraints are a mix of ‘less than’ and ‘greater than’ it is a Multiple Infinite Infeasible Mixed
29 problem having _______. Constraints constraints Constraints Constraints (d)
Outgoing Interchanging
30 The outgoing variable row in the simplex algorithm is called ________. Row Key Row Row Basic Row (b)
null scarce abundant
31 A resource which is partially utilized is called_________ in simplex. resource resource resource zero resource (c)
32 The value of one extra unit of resource is called ________ in simplex. unit price extra price retail price shadow price (d)
In simplex, a maximization problem is optimal when all Delta J, i.e. either zero either zero or
33 Cj – Zj values are _______. or positive negative only positive only negative (b)
Vogel’s
In a transportation problem, the method of penalties is called _________
Approximat
method.
34 ion Method NWCR LCM MODI (a)
2
 When there is a degeneracy in the transportation problem, we add an
35 imaginary allocation called ________ in the solution. dummy penalty regret epsilon (d)
If M + N – 1 = Number of allocations in transportation, it means _______. there is no degeneracy solution is problem is
36 (Where ‘M’ is number of rows and ‘N’ is number of columns) degeneracy exists optimum balanced (a)
An activity whose start or end cannot be delayed without affecting total
37 project completion time is called ______ activity. Dummy Non-critical Important Critical (d)
38 Floats for critical activities will be always be __________. one zero highest equal to duration (b)
The shortest possible completion time of an activity in PERT is
39 called_________ time. Optimistic pessimistic expected Most likely (a)
The total time required to complete all the jobs in a job sequencing Processing
40 problem is known as ________. time Waiting time Elapsed time Idle Time (c)
41 The participants in a game are called __________. Invitees Players Contestants Clients (b)
The outcome of the interaction of selected strategies of opponents in a
42 game is called ________. income profit payoff gains (c)
In a game, the alternatives or courses of action available to each player are
43 called ___________. choices strategies options actions (b)
A situation in a game where, in the payoff matrix, maximin of row is equal
44 to minimax of column is called _______. Centre point Saddle point Main point Equal point (b)
If there are ______ or more decision variables in a LPP, SIMPLEX
45 method is used. 2 3 1 4 (b)
Passes
Parallel to Parallel to Y through the intersects both
46 If 5y = 30, then the line is _________ X axis axis origin the axis (a)
47 Operations Research techniques are _______ in nature. Qualitative Quantitative Judgmental Subjective (b)
Forward pass calculations are done to find ________ occurrence times of
48 events. exact earliest latest approximate (b)
Feasible
49 The second longest path in the network diagram is called ____ _____Path. alternate solution critical Sub-critical (d)
When a particular assignment in the given problem is not possible or
50 restricted as a condition, it is called a ___________ problem. Degenerate Prohibited Infeasible unbalanced (b)