MCQ All Operation Research MCQ

lOMoARcPSD|10592554
OR MCQ ALL - Operation Research Mcq
Master of Commerce (Rashtrasant Tukadoji Maharaj Nagpur University)
Studocu is not sponsored or endorsed by any college or university

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)
lOMoARcPSD|10592554
1. ________are entities whose value is determined from the solution of LPP

A. objective function
B. decision variable
C. constraints
D. opportunity cost
A.objective function
2. The region of feasible solution in LPP graphical method is called ____

A. infeasible region
B. unbounded region
C. infinite region
D. feasible region
D.feasible region
3. The outgoing variable row in the simplex table is called ____

A. outgoing row
B. key row
C. basic row
D. interchanging row
C.basic row
4. When the solution is degenerate in transportation problem, we add a _

A. dummy
B. epsilon
C. penalty
D. regret
B.epsilon
5. ______method is used in Assignment Problem

A. ncwr
B. lcm
C. vam
D. hungarian
D.hungarian
6. The longest path in the network diagram is called ____

A. head path
B. sub path
C. critical path
D. sub critical path
C.critical path
7. 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
B.10
8. Pick the wrong relationship:

lOMoARcPSD|10592554
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
B.total float =free float + independent float
9. The shortest time in the PERT is called ______time

A. expected
B. pessimitic
C. optimistic
D. most likely
C.optimistic
10. 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
D.elapsed time
11. Operations Research Models in which values of all variables and all possible outcomes
are known with certainty are called models.
A. physical
B. symbolic
C. deterministic
D. probabilistic
C.deterministic
12. Operations Research Models in which some or all variables are random in nature are
called models.
A. physical
B. symbolic
C. deterministic
D. probabilistic
D.probabilistic
13. and are techniques applied in project management.

A. cpm and pert
B. assignment & transportation
C. game theory
D. decision theory& inventory models
A.cpm and pert
14. are the entities whose values are to be determined from the solution of the LPP.
B. decision variables
C. constraints
D. opportunity cost
B.decision variables

lOMoARcPSD|10592554
15. specifies the objective or goal of solving the LPP.

C. constraints
D. opportunity cost
A.objective function
16. _are the restrictions or limitations imposed on the LPP.

B. variables
C. constraints
D. profit
C.constraints
17. When it is not possible to find solution in LPP, it is called as solution

A. infeasible
B. unbounded
C. improper
D. unknown
A.infeasible
18. In case of a 8 9 constraint, the feasible region is a straight line.

A. less than or equal to
B. greater than or equal to
C. mixed
D. equal to
D.equal to
19. In linear programming, unbounded solution means solution.

A. infeasible
B. infinite
C. unique
D. degenerate
B.infinite
20. The incoming variable column in the simplex algorithm is called .

A. key column
B. incoming column
C. important column
D. variable column
A.key column
21. The intersection value of key column and key row is called
A. vital element
B. important element
C. basic element
D. key element
D.key element
22. The variable added to the LHS of a less than or equal to constraint to convert it into
equality is called variable.

lOMoARcPSD|10592554
A. surplus
B. artificial
C. slack
D. additional
C.slack
23. A resource which is completely utilized is called in simplex

A. null resource
B. scarce resource
C. abundant resource
D. zero resource
B.scarce resource
24. 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
A.either zero or positive
25. To find initial feasible solution of a transportation problem the method which starts
allocation from the lowest cost is called method
A. vogel9s approximat ion method
B. nwcr
C. lcm
D. Modi
C.lcm
26. 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
B.feasible solution
27. When the allocations of a transportation problem satisfy the rim condition (m + n – 1) the
solution is called
A. infeasible solution
C. non degenerate solution
D. degenerate solution
C.non degenerate solution
28. 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

lOMoARcPSD|10592554
D. lcm
discuss
A.vam
29. 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
B.unbalanced
30. The method used for solving an assignment problem is called method.
A. vam
B. nwcr
C. modi
D. hungarian
D.hungarian
31. When a maximization assignment problem is converted in minimization problem, the

resulting matrix is called matrix.
A. cost
B. regret
C. profit
D. dummy
B.regret
32. The longest path in the network diagram is called path

A. critical
B. sub-critical
C. best
D. worst
A.critical
33. Backward pass calculations are done to find occurrence times of events.
A. tentative
B. definite
C. latest
D. earliest
C.latest
34. 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
C.processing order
35. The time during which a machine remains waiting or vacant in sequencing problem is
called time.

lOMoARcPSD|10592554
A. processing
B. waiting
C. free
D. idle
D.idle
36. In linear programming represents mathematical equation of the limitations imposed by

the problem.
C. constraints
D. opportunity cost
C.constraints
37. The type of constraint which specifies maximum capacity of a resource

is 8or equal to9 constraint.
A. less than
B. greater than
C. not greater than
D. not less than
A.less than
38. The region of feasible solution in LPP graphical method is called region
A. infeasible
B. infinite
C. unbounded
D. feasible
D.feasible
39. When the constraints are a mix of 8less than9 and 8greater than9 it is a problem having .
A. multiple constraints
B. infinite constraints
C. infeasible constraints
D. mixed constraints
D.mixed constraints
40. The outgoing variable row in the simplex algorithm is called.

A. outgoing row
B. key row
C. interchanging row
D. basic row
B.key row
41. A resource which is partially utilized is called in simplex.

A. null resource
B. scarce resource
C. abundant resource
D. zero resource
C.abundant resource

lOMoARcPSD|10592554
42. The value of one extra unit of resource is called in simplex.

A. unit price
B. extra price
C. retail price
D. shadow price
D.shadow price
43. 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
B.either zero or negative
44. In a transportation problem, the method of penalties is called method.

A. vogel9s approximat ion method
B. nwcr
C. lcm
D. modi
A.vogel9s approximat ion method
45. 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
D.epsilon
46. If M + N – 1 = Number of allocations in transportation, it means . (Where 8M9 is number

of rows and 8N9 is number of columns)
A. there is no degeneracy
B. degeneracy exists
C. solution is optimum
D. problem is balanced
A.there is no degeneracy
47. 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
D.critical
48. Floats for critical activities will be always be .

A. one
B. zero
C. highest
D. equal to duration

lOMoARcPSD|10592554
B.zero
49. The shortest possible completion time of an activity in PERT is called time.
A. optimistic
B. pessimistic
C. expected
D. most likely
A.optimistic
50. 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
C.elapsed time
51. The participants in a game are called .

A. invitees
B. players
C. contestants
D. clients
B.players
52. The outcome of the interaction of selected strategies of opponents in a game is called .
A. income
B. profit
C. payoff
D. gains
C.payoff
53. In a game, the alternatives or courses of action available to each player are called .
A. choices
B. strategies
C. options
D. actions
B.strategies
54. 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
B.saddle point
55. If there are or more decision variables in a LPP, SIMPLEX method is used.
A. 2
B. 3
C. 1
D. 4

lOMoARcPSD|10592554
B.3
56. 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
A.parallel to x axis
57. Operations Research techniques are in nature.

A. qualitative
B. quantitative
C. judgmental
D. subjective
B.quantitative
58. Forward pass calculations are done to find occurrence times of events.
A. exact
B. earliest
C. latest
D. approximate
B.earliest
59. The second longest path in the network diagram is called Path.
A. alternate
C. critical
D. sub-critical
D.sub-critical
60. 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
B.prohibited
61. Operations Research (OR) , which is a very powerful tool for ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
A. Research
B. Decision – Making
C. Operations
D. None of the above
B.Decision – Making
62. Who coined the term Operations Research?

A. J.F. McCloskey
B. F.N. Trefethen
C. P.F. Adams
D. Both A and B

lOMoARcPSD|10592554
D.Both A and B
63. The term Operations Research was coined in the year ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
A. 1950
B. 1940
C. 1978
D. 1960
B.1940
64. This innovative science of Operations Research was discovered during ‐‐‐‐‐‐‐‐‐‐‐‐‐
A. Civil War
B. World War I
C. World War II
D. Industrial Revolution
C.World War II
65. Operations Research was known as an ability to win a war without really going in to a ‐‐‐‐
‐‐‐‐‐‐‐‐‐
A. Battle field
B. Fighting
C. War
D. Both A and B
D.Both A and B
66. Who defined Operations Research as scientific method of providing executive

departments witha quantitative basis for decisions regarding the operations under their
control?
A. Morse and Kimball (1946)
B. P.M.S. Blackett (1948)
C. E.L. Arnoff and M.J. Netzorg
A.Morse and Kimball (1946)
67. Who defined Operations Research as scientific approach to problem solving for
executivemanagement ?
A. E.L. Arnoff
B. P.M.S. Blackett
C. H.M. Wagner
C.H.M. Wagner
68. Who defined Operations Research as an aid for the executive in marketing his decisions
byproviding him with the quantitative information based on the scientific method of analysis
?
A. C. Kitte
B. H.M. Wagner
C. E.L. Arnoff
A.C. Kitte

lOMoARcPSD|10592554
69. Operations Research has the characteristics the it is done by a team of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
A. Scientists
B. Mathematicians
C. Academics
D. All of the above
A.Scientists
70. There is a great scope for ‐‐‐‐‐‐‐‐‐‐‐‐ working as a team to solve problems of defence by
using theOperations Research approach
A. Economists
B. Administrators
C. Statisticians and Technicians
D. All of the above
D.All of the above
71. Operations Research emphasizes on the overall approach to the system. This
charecteristics of Operations Research is often referred as
A. System Orientation
B. System Approach
C. Interdisciplinary Team Approach
D. none
D.none
72. Operations Research cannot give perfect ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ to problems

A. Answers
B. Solutions
C. Both A and B
D. Decisions
C.Both A and B
73. Operations Research simply helps in improving the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ of the solution but does
not resultin a perfect solution.
A. Quality
B. Clarity
C. Look
A.Quality
74. Operations Research involves ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ attack of complex problems to arrive at

theoptimum solution
A. Scientific
B. Systematic
C. Both A and B
D. Statistical
C.Both A and B
75. Operations Research uses models built by quantitative measurement of the variables c a
given problem and also derives a solution from the model using ‐‐‐‐‐‐‐‐‐‐‐‐‐ of the diversified
solution techniques oncerning
A. Two or more

lOMoARcPSD|10592554
B. One or more
C. Three or more
D. Only One
B.One or more

lOMoARcPSD|10592554
1. Operations management can be defined as the application of -----------------------------------

-------to a problem within a system to yield the optimal solution.
A. Suitable manpower
B. mathematical techniques, models, and tools
C. Financial operations
2. OR can evaluate only the effects of .

A. Personnel factors.
B. Financial factors
C. Numeric and quantifiable factors.
True-False
3. Operations Research started just before World War II in Britain with the establishment of
teams of scientists to study the strategic and tactical problems involved in military
operations.
A. True
B. False
4. The main limitation of operations research is that it often ignores the human element in
the production process.
A. True
B. False
5. Which of the following is not the phase of OR methodology?

A. Formulating a problem
B. Constructing a model
C. Establishing controls
D. Controlling the environment
6. The objective function and constraints are functions of two types of variables,
variables and variables.
7. Operations research was known as an ability to win a war without really going in to
A. Battle field
B. Fighting
C. The opponent
D. Both A and B
8. Hungarian Method is used to solve

lOMoARcPSD|10592554
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b
9. OR uses models to help the management to determine its

A. Policies
B. Actions
C. Both A and B
10. Which technique is used in finding a solution for optimizing a given objective, such as
profit maximization or cost reduction under certain constraints?
A. Quailing Theory
B. Waiting Line
C. Both A and B
D. Linear Programming
11. What enables us to determine the earliest and latest times for each of the events and
activities and thereby helps in the identification of the critical path?
A. Programme Evaluation
B. Review Technique (PERT)
C. Both A and B
D. Deployment of resources
12. OR techniques help the directing authority in optimum allocation of various limited
resources like
A. Men and Machine
B. Money
C. Material and Time
D. All of the above
13. The Operations research technique which helps in minimizing total waiting and service
costs is
A. Queuing Theory
B. Decision Theory
C. Both A and B
UNIT II
LINEAR PROGRAMMING PROBLEMS

lOMoARcPSD|10592554
14. Feasible solution satisfies

A. Only constraints
B. only non-negative restriction
C. [A] and [B] both
D. [A],[B] and Optimum solution
15. In Degenerate solution value of objective function .

A. increases infinitely
B. basic variables are nonzero
C. decreases infinitely
D. One or more basic variables are zero
16. Minimize Z =
A. –maximize(Z)
B. -maximize(-Z)
C. maximize(-Z)
D. none of the above
17. In graphical representation the bounded region is known as region.
A. Solution
B. basic solution
C. feasible solution
D. optimal
18. Graphical optimal value for Z can be obtained from

A. Corner points of feasible region
B. Both a and c
C. corner points of the solution region
19. In LPP the condition to be satisfied is

A. Constraints have to be linear
B. Objective function has to be linear
C. none of the above
D. both a and b
State True or False:

20. Objective function in Linear Programming problems has always finite value at the
optimal solution-TRUE
21. A finite optimal solution can be not unique- FALSE
22. Feasible regions are classified into bounded, unbounded, empty and multiple: TRUE
23. Corner points of a feasible region are located at the intersections of the region and
coordinate axes: TRUE
24. Identify the type of the feasible region given by the set of
inequalities x - y <= 1
x - y >= 2
where both x and y are positive.
lOMoARcPSD|10592554
A. A triangle
B. A rectangle
C. An unbounded region
D. An empty region
25. Consider the given vectors: a(2,0), b(0,2), c(1,1), and d(0,3). Which of the following
vectors are linearly independent?
A. a, b, and c are independent
B. a, b, and d are independent
C. a and c are independent
D. b and d are independent
26. Consider the

linear equation 2 x1 +
3 x2 - 4 x3 + 5 x4 =
10
How many basic and non-basic variables are defined by this equation?
A. One variable is basic, three variables are non-basic
B. Two variables are basic, two variables are non-basic
C. Three variables are basic, one variable is non-basic
D. All four variables are basic
27. In game theory, the outcome or consequence of a strategy is referred to as the

A. payoff.
B. penalty.
C. reward.
D. end-game strategy.
ASSIGNMENT PROBLEM
28. An assignment problem is considered as a particular case of a transportation problem

because
A. The number of rows equals columns
B. All xij= 0 or 1
C. All rim conditions are 1
D. All of the above
29. An optimal assignment requires that the maximum number of lines that can be drawn
through squares with zero opportunity cost be equal to the number of
A. Rows or columns
B. Rows & columns
C. Rows + columns –1 d.
30. While solving an assignment problem, an activity is assigned to a resource through a

square with zero opportunity cost because the objective is to
lOMoARcPSD|10592554
A. Minimize total cost of assignment

B. Reduce the cost of assignment to zero
C. Reduce the cost of that particular assignment to zero
D. All of the above
31. The method used for solving an assignment problem is called

A. Reduced matrix method
B. MODI method
C. Hungarian method
32. The purpose of a dummy row or column in an assignment problem is to

A. Obtain balance between total activities &total resources
B. Prevent a solution from becoming degenerate
C. Provide a means of representing a dummy problem
33. Maximization assignment problem is transformed into a minimization problem by

A. Adding each entry in a column from the maximization value in that column
B. Subtracting each entry in a column from the maximum value in that column
C. Subtracting each entry in the table from the maximum value in that table
D. Any one of the above
34. If there were n workers & n jobs there would be

lOMoARcPSD|10592554
A. n! solutions
B. (n-1)! solutions
C. (n!)nsolutions
D. n solutions
35. An assignment problem can be solved by

A. Simplex method
B. Transportation method
C. Both a & b
36. For a salesman who has to visit n cities which of the following are the ways of his tour
plan
A. n!
B. (n+1)!
C. (n-1)!
D. n
37. The assignment problem

A. Requires that only one activity be assigned to each resource
B. Is a special case of transportation problem
C. Can be used to maximize resources
D. All of the above
38. An assignment problem is a special case of transportation problem, where

A. Number of rows equals number of columns
B. All rim conditions are 1
C. Values of each decision variable is either 0 or 1
D. All of the above
39. Every basic feasible solution of a general assignment problem, having a square pay-off
matrix of order, n should have assignments equal t
A. 2n+1
B. 2n-1
C. m+n-1
D. m+n
40. To proceed with the MODI algorithm for solving an assignment problem, the number of
dummy allocations need to be added are
A. n
B. 2n
C. n-1
D. 2n-1

lOMoARcPSD|10592554
41. The Hungarian method for solving an assignment problem can also be used to solve
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b
42. An optimal solution of an assignment problem can be obtained only if

A. Each row & column has only one zero element
B. Each row & column has at least one zero element
C. The data is arrangement in a square matrix
43. Which method usually gives a very good solution to the assignment problem?
A. northwest corner rule
B. Vogel's approximation method
C. MODI method
D. stepping-stone method
44. In applying Vogel's approximation method to a profit maximization problem, row and
column penalties are determined by:
A. finding the largest unit cost in each row or column.
B. finding the smallest unit cost in each row or column.
C. finding the sum of the unit costs in each row or column.
D. finding the difference between the two lowest unit costs in each row and column.
E. finding the difference between the two highest unit costs in each row and column.
45. The northwest corner rule requires that we start allocating units to shipping
routes in the: middle cell.
A. Lower right corner of the table.
B. Upper right corner of the table.
C. Highest costly cell of the table.
D. Upper left-hand corner of the table.
.
46. The table represents a solution that is:

lOMoARcPSD|10592554
A. an initial solution.
B. Infeasible.
C. degenerate.
D. all of the above
E. none of the above
47. Which of the following is used to come up with a solution to the assignment problem?
A. MODI method
B. northwest corner method
C. stepping-stone method
D. Hungarian method
48. What is wrong with the following table?

lOMoARcPSD|10592554
A. The solution is infeasible.

B. The solution is degenerate.
C. The solution is unbounded.
D. Nothing is wrong.
E. The solution is inefficient in that it is possible to use fewer routes.
49. The solution presented in the following table is

lOMoARcPSD|10592554
A. infeasible.
B. degenerate.
C. unbounded.
D. Optimal.
50. The solution shown was obtained by Vogel's approximation. The difference between the
objective function for this solution and that for the optimal is
A. 40
B. 60
C. 80
D. 100
51. Optimal solution of an assignment problem can be obtained only if

A. Each row & column has only one zero element
B. Each row & column has at least one zero element
C. The data is arrangement in a square matrix
52. In assignment problem of maximization, the objective is to maximise

A. Profit
B. optimization
C. cost
UNIT IV
TRANSPORTATION PROBLEMS
53. What is the difference between minimal cost network flows and transportation
problems?

lOMoARcPSD|10592554
A. The minimal cost network flows are special cases of transportation problems
B. The transportation problems are special cases of the minimal cost network flows
C. There is no difference
D. The transportation problems are formulated in terms of tableaus, while the minimal
cost network flows are formulated in terms of graphs
54. With the transportation technique, the initial solution can be generated in any fashion
one chooses. The only restriction is that
A. the edge constraints for supply and demand are satisfied.
B. the solution is not degenerate.
C. the solution must be optimal.
D. one must use the northwest-corner method.
55. The purpose of the stepping-stone method is to

A. develop the initial solution to the transportation problem.
B. assist one in moving from an initial feasible solution to the optimal solution.
C. determine whether a given solution is feasible or not.
D. identify the relevant costs in a transportation problem.
56. The purpose of a dummy source or dummy destination in a transportation problem is to

A. prevent the solution from becoming degenerate.
B. obtain a balance between total supply and total demand.
C. make certain that the total cost does not exceed some specified figure.
D. provide a means of representing a dummy problem.
57. Which of the following is NOT needed to use the transportation model?
A. the cost of shipping one unit from each origin to each destination
B. the destination points and the demand per period at each
C. the origin points and the capacity or supply per period at each
D. degeneracy
58. Which of the following is a method for improving an initial solution in a

transportation problem?
A. northwest-corner
B. intuitive lowest-cost
C. southeast-corner rule
D. stepping-stone
59. The transportation method assumes that

A. there are no economies of scale if large quantities are shipped from one source to
one destination.

lOMoARcPSD|10592554
B. the number of occupied squares in any solution must be equal to the number of rows
in the table plus the number of columns in the table plus 1.
C. there is only one optimal solution for each problem.
D. the number of dummy sources equals the number of dummy destinations.
60. An initial transportation solution appears in the table.

Factory
C D
Capacity
A 10 0 10
B 15 25 40
Warehouse
25 25 50
Demand
Can this solution be improved if it costs $5 per unit to ship from A to C; $7 per unit to ship
from A to D; $8 to ship from B to C; and $9 to ship from B to D?
A. Yes, this solution can be improved by $50.

B. Yes, this solution can be improved by $100.
C. No, this solution is optimal.
D. Yes, the initial solution can be improved by $10.
61. What is the cost of the transportation solution shown in the table?
W X Y Supply
$3 $5 $9
A 70
20 50 0
$5 $4 $7
B 30
0 30 0
$10 $8 $3
C 120
40 0 80
Demand 60 80 80 220
A. $1350
B. $1070
C. $1150
D. $1230
62. Which statement regarding this transportation table is best?

W X Y Supply
$3 $5 $9
A 70
20 50 0
$5 $4 $7
B 30
0 30 0

lOMoARcPSD|10592554
$10 $8 $3
C 120
40 0 80
Demand 60 80 80 220
A. The solution is degenerate.
B. This solution can be improved by shipping from C to X.
C. This solution would be improved by shipping from B to W.
D. This solution was developed using the northwest corner rule.
63. Which of these statements about the stepping-stone method is best?
A. A dummy source and destination must be added if the number of rows plus columns
minus 1 is not equal to the number of filled squares.
B. Only squares containing assigned shipments can be used to trace a path back to
an empty square.
C. An improvement index that is a net positive means that the initial solution can be
improved.
D. Only empty squares can be used to trace a path back to a square containing an
assigned shipment
64. In a transportation problem, we must make the number of and

equal.
A. destinations; sources
B. units supplied; units demanded
C. columns; rows
D. positive cost coefficients; negative cost coefficients
E. warehouses; suppliers
65. or are used to "balance" an assignment or transportation problem.
A. Destinations; sources
B. Units supplied; units demanded
C. Dummy rows; dummy columns
D. Large cost coefficients; small cost coefficients
E. Artificial cells; degenerate cells
66. The net cost of shipping one unit on a route not used in the current transportation
problem solution is called the .
A. change index
B. new index
C. MODI index
D. idle index
E. Improvement index

lOMoARcPSD|10592554
67. The procedure used to solve assignment problems wherein one reduces the original
assignment costs to a table of opportunity costs is called .
A. stepping-stone method
B. matrix reduction
C. MODI method
D. northwest reduction
E. simplex reduction
68. The method of finding an initial solution based upon opportunity costs is called
.
A. the northwest corner rule
B. Vogel's approximation
C. Johanson's theorem
D. Flood's technique
E. Hungarian method
69. An assignment problem can be viewed as a special case of transportation problem in

which the capacity from each source is and the demand at each destination is
.
A. 1; 1
B. Infinity; infinity
C. 0; 0
D. 1000; 1000
E. -1; -1
70. occurs when the number of occupied squares is less than the number of rows plus
A. Degeneracy
B. Infeasibility
C. Unboundedness
D. Unbalance
E. Redundancy
71. Both transportation and assignment problems are members of a category of LP

problems called .
A. shipping problems
B. logistics problems
C. generalized flow problems
D. routing problems
E. network flow problems
72. The equation Ri + Kj = Cij is used to calculate .

lOMoARcPSD|10592554
A. an improvement index for the stepping-stone method

B. the opportunity costs for using a particular route
C. the MODI cost values (Ri, Kj)
D. the degeneracy index
E. optimality test
73. In case of an unbalanced problem, shipping cost coefficients of are assigned

to each created dummy factory or warehouse.
A. very high positive costs
B. very high negative costs
C. 10
D. zero
E. one
74. The initial solution of a transportation problem can be obtained by applying any
known method. However, the only condition is that
A. The solution be optimal
B. The rim conditions are satisfied
C. The solution not be degenerate
D. All of the above
75. The dummy source or destination in a transportation problem is added to

A. Satisfy rim conditions
B. Prevent solution from becoming degenerate
C. Ensure that total cost does not exceed a limit
76. The occurrence of degeneracy while solving a transportation problem means that
A. Total supply equals total demand
B. The solution so obtained is not feasible
C. The few allocations become negative
77. An alternative optimal solution to a minimization transportation problem exists

whenever opportunity cost corresponding to unused route of transportation is:
A. Positive & greater than zero
B. Positive with at least one equal to zero
C. Negative with at least one equal to zero
78. One disadvantage of using North-West Corner rule to find initial solution to the
transportation problem is that
A. It is complicated to use

lOMoARcPSD|10592554
B. It does not take into account cost of transportation

C. It leads to a degenerate initial solution
D. All of the above
79. The solution to a transportation problem with 8m9 rows (supplies) & 8n9 columns
(destination) is feasible if number of positive allocations are
A. m+n
B. m*n
C. m+n-1
D. m+n+1
80. If an opportunity cost value is used for an unused cell to test optimality, it should be
A. Equal to zero
B. Most negative number
C. Most positive number
D. Any value
81. During an iteration while moving from one solution to the next, degeneracy may
occur when
A. The closed path indicates a diagonal move
B. Two or more occupied cells are on the closed path but neither of them represents a
corner of the path.
C. Two or more occupied cells on the closed path with minus sign are tied for lowest
circled value
D. Either of the above
82. The large negative opportunity cost value in an unused cell in a transportation table is
chosen to improve the current solution because
A. It represents per unit cost reduction
B. It represents per unit cost improvement
C. It ensure no rim requirement violation
83. The smallest quantity is chosen at the corners of the closed path with negative sign to be
assigned at unused cell because
A. It improve the total cost
B. It does not disturb rim conditions
C. It ensure feasible solution
D. All of the above
84. When total supply is equal to total demand in a transportation problem, the problem is
said to be
A. Balanced

lOMoARcPSD|10592554
B. Unbalanced
C. Degenerate
85. Which of the following methods is used to verify the optimality of the current solution of
the transportation problem
A. Least cost method
B. Vogel9s approximation method
C. Modified distribution method
D. All of the above
86. The degeneracy in the transportation problem indicates that

A. Dummy allocation(s) needs to be added
B. The problem has no feasible solution
C. The multiple optimal solution exist
D. a & b but not c
87. In a transportation problem, when the number of occupied routes is less than the
number of rows plus the number of columns -1, we say that the solution is:
A. Unbalanced.
B. Infeasible.
C. Optimal.
D. impossible.
E. Degenerate.
88. The only restriction we place on the initial solution of a transportation problem
is that: we must have nonzero quantities in a majority of the boxes.
A. all constraints must be satisfied.
B. demand must equal supply.
C. we must have a number (equal to the number of rows plus the number of columns
minus one) of boxes which contain nonzero quantities.
89. The initial solution of a transportation problem can be obtained by applying any
known method. However, the only condition is that
A. the solution be optimal
B. the rim condition are satisfied
C. the solution not be degenerate
D. all of the above
90. The dummy source or destination in a transportation problem is added to

A. satisfy rim condition
B. prevent solution from becoming degenerate

lOMoARcPSD|10592554
C. ensure that total cost does not exceed a limit

D. all of the above
91. The occurrence of degeneracy while solving a transportation problem means that
A. total supply equals total demand
B. the solution so obtained is not feasible
C. the few allocations become negative
92. An alternative optimal solution to a minimization transportation problem exists

whenever opportunity cost corresponding to unused routes of transportation is:
A. positive and greater than zero
B. positive with at least one equal to zero
C. negative with at least one equal to zero
D. all of the above
93. One disadvantage of using North-West Corner Rule to find initial solution to the
transportation problem is that
A. it is complicated to use
B. it does not take into account cost of transportation
C. it leads to degenerate initial solution
D. all of the above

lOMoARcPSD|10592554
A petrol pump have one pump; Vehicles arrive at the petrol pump according to poison input process
at average of 12 per hour. The service time follows exponential distribution with a mean of 4 minutes.
The pumps are expected to be idle for ______________.(CO4)(BTL3)
A) 3/5
B) 4/5
C) 5/3
D) 6/5
ANSWER: B
A queuing system is said to be a ______________ when its operating characteristic are independent
upon time(CO4)(BTL2)
A) pure birth model
B) pure death model
C) transient state
D) steady state
ANSWER: D
An activity whose start or end cannot be delayed without affecting total project completion time is
called ____activity (CO4)(BTL2)
A) dummy
B) non critical
C) critical
D) importatnt
ANSWER: C
A) dummy
B) non critical
C) critical
D) importatnt
ANSWER: C
A) dummy
B) non critical
C) critical
D) importatnt

lOMoARcPSD|10592554
ANSWER: C
Floats for critical activities will always be _____ (CO4)(BTL2)
A) one
B) zero
C) same
D) same as duration of activity
ANSWER: B
A) one
B) zero
C) same
ANSWER: B
A) one
B) zero
C) same
ANSWER: B
For = constraints what will be the coefficient of initial feasible solution in objective function for
minimization (CO1)(BTL3)
A) M for A
B) -M for A
C) M for S
D) -M for S
ANSWER: A
A) M for A
B) -M for A
C) M for S
D) -M for S
ANSWER: A

lOMoARcPSD|10592554
A) M for A
B) -M for A
C) M for S
D) -M for S
ANSWER: A
For = constraints what will be the initial feasible solution (CO1)(BTL3)
A) Artificial variable
B) Slack variable
C) Slack and artificial variable
D) None of the above
ANSWER: A
B) Slack variable
ANSWER: A
B) Slack variable
ANSWER: A
For Maximization problem what is the condition for Cj-Ej (CO1)(BTL3)
A) Zero
B) Negative
C) Zero or Negative
D) Positive or Zero
ANSWER: C
A) Zero

lOMoARcPSD|10592554
B) Negative
C) Zero or Negative
D) Positive or Zero
ANSWER: C
A) Zero
B) Negative
C) Zero or Negative
D) Positive or Zero
ANSWER: C
Group replacement policy applies to(CO2)(BTL1)
A) Irreparable items
B) Repairable items
C) Items that fail partially
D) Items that fail completely & suddenly
ANSWER: D
Group replacement policy is most suitable for(CO2)(BTL1)
A) Trucks
B) Infant machines
C) Street light bulbs
D) New cars
ANSWER: C
If a machine becomes old, then the failure rate expected will be(CO2)(BTL1)
A) Constant
B) Increasing
C) Decreasing
D) none
ANSWER: B
If the number of rows and columns in an assignment problem are not equal than it is
called______problem(CO2)(BTL2)
A) prohibited
B) infeasible
C) unbounded

lOMoARcPSD|10592554
D) unbalanced
ANSWER: D
A) prohibited
B) infeasible
C) unbounded
D) unbalanced
ANSWER: D
A) prohibited
B) infeasible
C) unbounded
D) unbalanced
ANSWER: D
In assignment problem of maximization, the objective is to maximise(CO2)(BTL2)
A) Profit
B) optimization
C) cost
ANSWER: A
A) Profit
B) optimization
C) cost
ANSWER: A
A) Profit
B) optimization
C) cost
ANSWER: A

lOMoARcPSD|10592554
In game the alternatives or courses of action available to each player are called________(CO2)(BTL2)
A) options
B) choices
C) actions
D) strategies
ANSWER: D
In program evaluation review technique network each activity time assume a beta distribution
because______________.(CO4)(BTL2)
A) it is a unimodal distribution that provides information regarding the uncertainty of time estimates
of activities
B) it has got finite non-negative error
C) it need not be symmetrical about model value
D) the project is progressing well
ANSWER: A
because______________.(CO4)(BTL2)
of activities
ANSWER: A
because______________.(CO4)(BTL2)
of activities
ANSWER: A
In project crashing as we systematically crash the project direct cost of project _____and indirect cost
of project_______ (CO4)(BTL3)
A) increases -decreases
B) decreases-increases
C) increases-remain same
D) remain same - decreases

lOMoARcPSD|10592554
ANSWER: A
ANSWER: A
ANSWER: A
In project crashing rent and overheads are treated as______cost (CO4)(BTL2)
A) significant
B) insignificant
C) direct
D) indirect
ANSWER: D
A) significant
B) insignificant
C) direct
D) indirect
ANSWER: D
A) significant
B) insignificant
C) direct
D) indirect
ANSWER: D

lOMoARcPSD|10592554
In project crashing the cost associated with actual activities(eg: manpower,materials,machinery

etc)are called _____cost (CO4)(BTL3)
A) visible
B) measurable
C) direct
D) indirect
ANSWER: C

A) visible
B) measurable
C) direct
D) indirect
ANSWER: C

A) visible
B) measurable
C) direct
D) indirect
ANSWER: C
In replacement analysis the maintenance cost is a function of(CO2)(BTL1)
A) none from listed
B) Low cost items are to be replaced, where record keeping is a problem
C) initial investment
D) time
ANSWER: D
Maximization of objective function in LPP means (CO1)(BTL1)
A) Value occurs at allowable set decision
B) highest value is chosen among allowable decision
C) none of the above
D) all of the above
ANSWER: B

lOMoARcPSD|10592554
D) all of the above
ANSWER: B
D) all of the above
ANSWER: B
Operations research is the application of ____________methods to arrive at the optimal Solutions to

the problems. (CO1)(BTL1)
A) economical
B) scientific
C) a and b both
D) Artistic
ANSWER: B

A) economical
B) scientific
C) a and b both
D) Artistic
ANSWER: B

A) economical
B) scientific
C) a and b both
D) Artistic
ANSWER: B
Optimal solution of an assignment problem can be obtained only if (CO2)(BTL2)
A) Each row & column has only one zero element

lOMoARcPSD|10592554
B) Each row & column has at least one zero element
C) The data is arrangement in a square matrix
ANSWER: A
ANSWER: A
ANSWER: A
OR has a characteristics that it is done by a team of (CO1)(BTL1)
A) Scientists
B) Mathematicians
C) Academics
D) All of the above
ANSWER: D
A) Scientists
B) Mathematicians
C) Academics
D) All of the above
ANSWER: D
A) Scientists
B) Mathematicians
C) Academics
D) All of the above

lOMoARcPSD|10592554
ANSWER: D
Replacement is said to be necessary if(CO2)(BTL2)
A) Failure rate is increasing
B) Failure cost is increasing
C) Failure probability is increasing
D) Any of these
ANSWER: D
Safety inventory is also known as:(CO2)(BTL2)
A) Buffer stock
B) Safety stock
C) Both A&B
D) None
ANSWER: C
Service mechanism in a queuing system is characterized by ______________.(CO4)(BTL2)
A) customers behavior
B) servers behavior
C) customers in the system
D) server in the system
ANSWER: B
The average arrival rate in a single server queuing system is 10 customers per hour and average
service rate is 15 customers per hour. The average time that a customer must wait before it is taken
up for service shall be ______________minutes.(CO4)(BTL3)
A) 6
B) 8
C) 10
D) 12
ANSWER: B
The extra row or column which is added to balance an assignment problem is called ____(CO2)(BTL2)
A) regret
B) epsilon
C) dummy
D) extra
ANSWER: C

lOMoARcPSD|10592554
A) regret
B) epsilon
C) dummy
D) extra
ANSWER: C
A) regret
B) epsilon
C) dummy
D) extra
ANSWER: C
The first step in formulating a linear programming problem is (CO1)(BTL1)
A) Identify any upper or lower bound on the decision variables
B) State the constraints as linear combinations of the decision variables
C) Understand the problem
D) Identify the decision variables
ANSWER: D
ANSWER: D
ANSWER: D
The method of solution of assignment problem is called _____(CO2)(BTL2)
A) NWCR
B) VAM
C) LCM

lOMoARcPSD|10592554
D) Hungarian
ANSWER: D
A) NWCR
B) VAM
C) LCM
D) Hungarian
ANSWER: D
A) NWCR
B) VAM
C) LCM
D) Hungarian
ANSWER: D
The outcome of the interaction of selected strategies of opponents in a game is called

_______(CO2)(BTL2)
A) income
B) profit
C) paayoff
D) gains
ANSWER: C
The participants in a game are called ______(CO2)(BTL2)
A) Clients
B) members
C) Customers
D) Players
ANSWER: D
The process that performs the services to the customer is known as ______________.(CO4)(BTL1)
A) queue
B) service channel
C) customers
D) server
ANSWER: B

lOMoARcPSD|10592554
The production manager will not recommend group replacement policy in case of(CO2)(BTL2)
A) When large number of identical items is to be replaced
B) Low cost items are to be replaced, where record keeping is a problem
C) For items that fail completely
D) Repairable items
ANSWER: D
The time required by each job on each machine is called as__________time(CO2)(BTL1)
A) elapsed
B) idle
C) processing
D) average
ANSWER: C
The total time required to complete all the jobs in sequencing problem is
called___________time(CO2)(BTL1)
A) elapsed
B) idle
C) processing
D) average
ANSWER: A
The two types of cost involved in project crashing are _____and____cost (CO4)(BTL2)
A) direct and indirect
B) total and partial
C) visible and invisible
D) measurable and non measurable
ANSWER: A
ANSWER: A

lOMoARcPSD|10592554
ANSWER: A
In the linear programming, the lack of points for a solution set is said to
A) have no feasible solution
B) HAVE A FEASIBLE SOLUTION
C) have single point method
D) have infinte point method
ANSWER: B
Assignment Model is Used for
A) allocation of resources
B) shortest route
C) optimization
D) feasible solution
ANSWER: A
CPM is
A) Critical Project Management
B) Critical Path Management
C) Critical Path Method
D) Crash Project Method
ANSWER: C
What are the types of variations in assignment problems?(CO2)(BTL2)
A) Non square matrix
B) Maximization problem
C) Restriction on assignment
D) All the above
ANSWER: D
D) All the above

lOMoARcPSD|10592554
ANSWER: D
D) All the above
ANSWER: D
Which Method is used for solving sequencing problem?(CO2)(BTL1)
A) MODI
B) VAM
C) S M Johnson
D) None
ANSWER: C
Which of the following is the correct assumption for replacement policy when money value does not
change with time?(CO2)(BTL1)
A) No Capital cost
B) No scrap value
C) Constant scrap value
D) Zero maintenance cost
ANSWER: C
Which of the following statements are NOT true of simulation?(CO4)(BTL2)
A) A simulation model cannot prescribe what should be done about a problem
B) The equations describing the operating characteristics of the system are known
C) Simulation models can be used to study alternative solutions to a problem
D) Simulation models the behaviour of a system
ANSWER: B

MCQ All Operation Research MCQ

Uploaded by

Copyright:

Available Formats

You might also like

MCQ All Operation Research MCQ

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MCQ All Operation Research MCQ

Uploaded by

Copyright:

Available Formats

lOMoARcPSD|10592554

OR MCQ ALL - Operation Research Mcq

Master of Commerce (Rashtrasant Tukadoji Maharaj Nagpur University)

Studocu is not sponsored or endorsed by any college or university

1. ________are entities whose value is determined from the solution of LPP

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

3. The outgoing variable row in the simplex table is called ____

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

5. ______method is used in Assignment Problem

6. The longest path in the network diagram is called ____

8. Pick the wrong relationship:

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

A. interfering float = total float – free float

9. The shortest time in the PERT is called ______time

13. and are techniques applied in project management.

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

15. specifies the objective or goal of solving the LPP.

16. _are the restrictions or limitations imposed on the LPP.

17. When it is not possible to find solution in LPP, it is called as solution

18. In case of a 8 9 constraint, the feasible region is a straight line.

19. In linear programming, unbounded solution means solution.

20. The incoming variable column in the simplex algorithm is called .

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

23. A resource which is completely utilized is called in simplex

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

31. When a maximization assignment problem is converted in minimization problem, the

32. The longest path in the network diagram is called path

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

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

37. The type of constraint which specifies maximum capacity of a resource

40. The outgoing variable row in the simplex algorithm is called.

41. A resource which is partially utilized is called in simplex.

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

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

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

46. If M + N – 1 = Number of allocations in transportation, it means . (Where 8M9 is number

48. Floats for critical activities will be always be .

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

51. The participants in a game are called .

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

56. If 5y = 30, then the line is

57. Operations Research techniques are in nature.

62. Who coined the term Operations Research?

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

66. Who defined Operations Research as scientific method of providing executive

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

72. Operations Research cannot give perfect ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ to problems

74. Operations Research involves ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ attack of complex problems to arrive at

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

1. Operations management can be defined as the application of -----------------------------------

2. OR can evaluate only the effects of .

5. Which of the following is not the phase of OR methodology?

8. Hungarian Method is used to solve

9. OR uses models to help the management to determine its

Downloaded by Aarifa Gaur (arifanadeem24@gmail.com)

14. Feasible solution satisfies