Operations Research
Operations Research
2) Which of the following statements about the northwest corner rule is false?
a) One must exhaust the supply for each row before moving down to the next row
b) One must exhaust the demand requirements of each column before moving to the next column
c) When moving to a new row or column, one must select the cell with the lowest cost
d) One must check that all supply and demand constraints are met
e) All of the above are false
Answer : C) When moving to a new or column, one must select the cell with the lowest cost
5) When the number of shipments in a feasible solution is less than the number of rows plus the
number of columns minus one
a) the solution is optimal
b) there is degeneracy, and an artificial allocation must be created
c) a dummy source must be created
d) a dummy destination must be created
e) the closed path has a triangular shape
Answer :there is degeneracy, and artificial allocation must be created
10) Which of the following would not generally be a motive for a firm to hold inventories? To
a) take advantage of quantity discounts
b) minimize holding costs
c)reduce stockout risks
d) decouple production from distribution
e) meet anticipated demand
Answer : minimize holdings cost
12) ABC analysis divides on-hand inventory into three classes, generally based upon
a) unit price
b) the number of units on hand
c) annual demand
d) annual dollar volume
e) item quality
Answer : annual dollar volume
13) Among the advantages of cycle counting is that itmakes the annual physical inventory more
acceptable to management
a) allows more rapid identification of errors and consequent remedial action than is possible with annual
physical inventory
b) does not require the detailed inventory records necessary when annual physical inventory is used
c) does not require highly trained people
d) does not need to be performed for less expensive items
Answer : allows more rapid identification of errors and consequent remedial action than is possible with
annual physical inventory
14)The two most basic inventory questions answered by the typical inventory model are
a) timing and cost of orders
b) quantity and cost of orders
c) timing and quantity of orders
d) order quantity and service level
e) ordering cost and carrying cost
Answer : timing and quantity of orders
15) An inventory decision rule states that "when the inventory level goes down to 14 gearboxes, 100
gearboxes will be ordered)" Which of the following statements is true?
a) 100 is the reorder point, and 14 is the order quantity)
b) The number 100 is a function of demand during lead time)
c) 14 is the safety stock, and 100 is the reorder point)
d) 14 is the reorder point, and 100 is the order quantity)
Answer : 14 is the reorder point and 100 is the order quantity
17)) Which of the following statements regarding the Production Order Quantity model is true?
a) It applies only to items produced in the firm's own production departments)
b) It relaxes the assumption that the demand rate is constant)
c) It minimizes the total production costs)
d) It relaxes the assumption that all the order quantity is received at one time)
e) It minimizes inventory)
Answer : It relaxed the assumption that all the order quantity is received at one time
20) For which of the following operations would a fixed-position layout be most appropriate?
a) assembly of an automobile
b) production of cameras and TV sets
c) construction of a ship
d) refining of crude oil
e) grocery store
21) The type of layout which features departments or other functional groupings in which similar
activities are performed is
a) process
b) product
c) fixed-position
d) mass
e) unit
25) which type of layout is used to achieve a smooth and rapid flow of large volumes of output?
a) process
b) batch
c) product
d) unit
e) fixed-position
Answer : b)batch
27) What is the difference between minimal cost network flows and transportation problems?
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
Answer : b)The transportation problems are special cases of the minimal cost network flows
28) 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)
Answer : a) the edge constraints for supply and demand are satisfied)
31) 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
Answer : d. degeneracy
32) 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
Answer : d. Stepping – stone
35) 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
Answer : e)Improvement index
36) 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
answer : b) Matrix reduction
37) 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
Answer : b) vogels approximation
38) 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
Answer : a. 1;1
39) 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
Answer : degenracy
40) 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
answer : b. logistics problems
41) The equation Ri + Kj = Cij is used to calculate an improvement index for the stepping-stone method
a) the opportunity costs for using a particular route
b) the MODI cost values (Ri, Kj)
c) the degeneracy index
d) optimality test
answer : b. the MODI cost values (Ri, Kj)
42) 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
answer: d. Zero
43) 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
Answer : b. the rim conditions are satisfied
46) 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
d) None of the above
Answer : positive with at least one equal to zero
47) 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 a degenerate initial solution
d) All of the above
Answer : it does not take into account cost of transportation
48) The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is
feasible if number of positive allocations are
a) m+n
b) m*n
c) m+n-1
d) m+n+1
answer : m+n-1
49) 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
Answer : most negative
50) 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
Answer : two or more occupied cells on the closed paths with minus sign are tied for lowest circled
value
51) 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
d) None of the above
Answer : it represents per unit cost reduction
52) 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
Answer : it ensure feasible solutions
53) When total supply is equal to total demand in a transportation problem, the problem is said to be
a) Balanced
b) Unbalanced
c) Degenerate
d) None of the above
Answer : balanced
54) Which of the following methods is used to verify the optimality of the current solution of the
transportation problem
a) Least cost method
b) Vogel’s approximation method
c) Modified distribution method
Answer : Modified distribution method
56) 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
Answer : degenerate)
57) 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)
d) None of the above
Answer : all constraints must be satisfied
58) 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
answer : the solution be optimal
60) 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
d) none of the above
answer : the solution so be obtained is not feasible
61) 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
Answer : positive with at least one equal to zero
62) 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
Answer : it does not take into account cost of transportation
63) In a transportation problem, we must make the number of __________ and __________ equal)
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
Answer : Units supplied ; units demanded
64) 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
Answer : improvement index
65) __________ occurs when the number of occupied squares is less than the number of rows plus the
number of columns minus one)
a) Degeneracy
b) Infeasibility
c) Unboundedness
d) Unbalance
Answer : degeneracy
(a) best
(b) worst
(c) sub-critical
(d) Critical
Answer: Critical
a) clients
b) members
c) customers
d) players
Answer: Players
70) A situation in a game where, in the payoff matrix, maximin of row is equal to minimax of column is
called .
e) centre point
f) main point
g) saddle point
h) equal point
Answer: saddle point
71) The order in which machines are required for completing the jobs is called
.
72) The total time required to complete all the jobs in a job sequencing problem is known as .
(i) idle time
(j) processing time
(k) elapsed time
(l) processing order
Answer: elapsed time
73) The outcome of the interaction of selected strategies of opponents in a game is called .
i) income
j) profit
k) payoff
l) Gains
Answer: payoff
74) The maximum time in which an activity will be completed assuming all possible delays and
postponements is termed as .
(a) optimistic time
(b) most likely time
(c) pessimistic time
(d) expected time
Answer: pessimistic time
75) In PERT, the expected project completion time is also called as project completion
time.
(a) average
(b) normal
(c) mean
(d) Critical
Answer: mean
(76) 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
Ans.: (1 – Deterministic
(77) Operations Research Models in which some or all variables are random in nature are called
____________models.
(a) Physical
(b) Symbolic
(c) Deterministic
(d) Probabilistic
Answer: (Probabilistic)
81) ______________ are the entities whose values are to be determined from the solution of the
LPP.
a) Objective function
b) Decision Variables
c) Constraints
d) Opportunity costs
Answer: (Decision variables)
85) The type of constraint which specifies maximum capacity of a resource is ‘_____________ or equal
to’ constraint.
a) Less than
b) Greater than
c) Less than or greater than
Answer: less than
a) Objective function
b) Decision variable
c) Redundancy
d) Constraints
Answer: Constraints
88) When it is not possible to find solution in LPP, it is called as case of__________________
(a) Unknown solution
(b) Unbounded solution
(c) Infeasible solution
(d) Improper solution
Answer: Infeasible solution
89) When the feasible region is such that the value of objective function can extend to infinity, it is
called a case of ______________.
(a) Infeasible solution
(b) Alternate optimal
(c) Unbounded solution
(d) Unique solution
Answer: Unbounded solution
90) When the constraints are a mix of ‘less than’ and ‘greater than’ it is a problem having
______________.
(a) Multiple constraints
(b) Infinite constraints
(c) Infeasible constraints
(d) Mixed constraints
Answer: Mixed constraints
Answer: sub-critical
(a) pessimistic
(b) optimistic
(c) most likely
(d) Expected
Answer: optimistic
95) The order in which machines are required for completing the jobs is called
.
97) 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) main point
c) saddle point
d) equal point
Answer: saddle point
98) The outcome of the interaction of selected strategies of opponents in a game is called _ .
a) income
b) profit
c) payoff
d) Gains
Answer: payoff
99) The maximum time in which an activity will be completed assuming all possible delays and
postponements is termed as .
(a) optimistic time
(b) most likely time
(c) pessimistic time
(d) expected time
Answer: pessimistic time
100) The two types of costs involved in project crashing are and
costs.