Operations Research Online MCQ Set 9

QN01. Feasible solution satisfies __________

1. Only constraints
2. only non-negative restriction
3. [a] and [b] both
4. [a],[b] and Optimum solution

Answer

(C)[a] and [b] both

QN02. Graphical optimal value for Z can be obtained from

1. Corner points of feasible region
2. Both a and c
3. corner points of the solution region
4. none of the above

Answer

(A)Corner points of feasible region

QN03. Hungarian Method is used to solve

1. A transportation problem
2. A travelling salesman problem
3. A LP problem
4. Both a & b

Answer

(B)A travelling salesman problem

QN04. 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.

1. A triangle
2. A rectangle
3. An unbounded region
4. An empty region

Answer

(D)An empty region

QN05. If an opportunity cost value is used for an unused cell to test optimality, it should be

1. Equal to zero
2. Most negative number
3. Most positive number
4. Any value

Answer

(B)Most negative number

QN06. In a transportation problem, we must make the number of __________ and __________ equal.

1. destinations; sources
2. units supplied; units demanded
3. columns; rows
4. positive cost coefficients; negative cost coefficients
5. warehouses; suppliers

Answer

(B)units supplied; units demanded

QN07. 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:

1. Unbalanced.
2. Infeasible.
3. Optimal.
4. impossible.
5. Degenerate.

Answer

(E)Degenerate

QN08. In assignment problem of maximization, the objective is to maximise

1. Profit
2. optimization
3. cost
4. None of the above

Answer

(A)Profit

QN09. In case of an unbalanced problem, shipping cost coefficients of __________ are assigned to each created dummy factory or warehouse.

1. very high positive costs
2. very high negative costs
3. 10
4. zero
5. one

Answer

(D)zero

QN10. In Degenerate solution value of objective function __________.

1. increases infinitely
2. basic variables are nonzero
3. decreases infinitely
4. One or more basic variables are zero

Answer

(D)One or more basic variables are zero

QN11. In game theory, the outcome or consequence of a strategy is referred to as the

1. payoff.
2. penalty.
3. reward.
4. end-game strategy.

Answer

(A)payoff.

QN12. In graphical method the restriction on number of constraint is __________.

1. 2
2. not more than 3
3. 3
4. none of the above

Answer

(D)none of the above

QN13. In graphical representation the bounded region is known as __________ region.

1. Solution
2. basic solution
3. feasible solution
4. optimal

Answer

(C)feasible solution

QN14. In LPP the condition to be satisfied is

1. Constraints have to be linear
2. Objective function has to be linear
3. none of the above
4. both a and b

Answer

(D)both a and b

QN15. In operations research, the __________ are prepared for situations.

1. mathematical models
2. physical models diagrammatic
3. diagrammatic models
4. all of above

Answer

(A)mathematical models

QN16. One disadvantage of using North-West Corner rule to find initial solution to the transportation problem is that

1. It is complicated to use
2. It does not take into account cost of transportation
3. It leads to a degenerate initial solution
4. All of the above

Answer

(B)It does not take into account cost of transportation

QN17. Operations management can be defined as the application of __________ to a problem within a system to yield the optimal solution.

1. Suitable manpower
2. mathematical techniques, models, and tools
3. Financial operations
4. all of above

Answer

(B)mathematical techniques, models, and tools

QN18. Operations research is based upon collected information, knowledge and advanced study of various factors impacting a particular operation. This leads to more informed __________.

1. Management processes
2. Decision making
3. Procedures
4. all of above

Answer

(B)Decision making

QN19. Operations research is the application of __________ methods to arrive at the optimal Solutions to the problems.

1. economical
2. scientific
3. a and b both
4. artistic

Answer

(B)scientific

QN20. Operations research was known as an ability to win a war without really going in to __________

1. Battle field
2. Fighting
3. The opponent
4. Both A and B

Answer

(D)Both A and B

QN21. Optimal solution of an assignment problem can be obtained only if

1. Each row & column has only one zero element
2. Each row & column has at least one zero element
3. The data is arrangement in a square matrix
4. None of the above

Answer

(A)Each row & column has only one zero element

QN22. OR can evaluate only the effects of __________.

1. Personnel factors.
2. Financial factors
3. Numeric and quantifiable factors.
4. all of above

Answer

(C)Numeric and quantifiable factors.

QN23. OR has a characteristics that it is done by a team of

1. Scientists
2. Mathematicians
3. Academics
4. All of the above

Answer

(D)All of the above

QN24. OR techniques help the directing authority in optimum allocation of various limited resources like __________

1. Men and Machine
2. Money
3. Material and Time
4. All of the above

Answer

(D)All of the above

QN25. OR uses models to help the management to determine its __________

1. Policies
2. Actions
3. Both A and B
4. None of the above

Answer

(C)Both A and B

QN26. The degeneracy in the transportation problem indicates that

1. Dummy allocation(s) needs to be added
2. The problem has no feasible solution
3. The multiple optimal solution exist
4. a & b but not c

Answer

(C)The multiple optimal solution exist

QN27. The dummy source or destination in a transportation problem is added to

1. Satisfy rim conditions
2. Prevent solution from becoming degenerate
3. Ensure that total cost does not exceed a limit
4. None of the above

Answer

(A)Satisfy rim conditions

QN28. The equation Ri + Kj = Cij is used to calculate __________.

1. an improvement index for the stepping-stone method
2. the opportunity costs for using a particular route
3. the MODI cost values (Ri, Kj)
4. the degeneracy index
5. optimality test

Answer

(C)the MODI cost values (Ri, Kj)

QN29. The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that

1. The solution be optimal
2. The rim conditions are satisfied
3. The solution not be degenerate
4. All of the above

Answer

(B)The rim conditions are satisfied

QN30. The large negative opportunity cost value in an unused cell in a transportation table is chosen to improve the current solution because

1. It represents per unit cost reduction
2. It represents per unit cost improvement
3. It ensure no rim requirement violation
4. None of the above

Answer

(A)It represents per unit cost reduction

QN31. The method of finding an initial solution based upon opportunity costs is called __________.

1. the northwest corner rule
2. Vogel’s approximation
3. Johanson’s theorem
4. Flood’s technique
5. Hungarian method

Answer

(B)Vogel’s approximation

QN32. The net cost of shipping one unit on a route not used in the current transportation problem solution is called the __________.

1. change index
2. new index
3. MODI index
4. idle index
5. Improvement index

Answer

(E)Improvement index

QN33. The objective function and constraints are functions of two types of variables, __________ variables and __________ variables.

1. Positive and negative
2. Controllable and uncontrollable
3. Strong and weak
4. None of the above

Answer

(B)Controllable and uncontrollable

QN34. The objective function for a minimization problem is given by
z = 2 x1 – 5 x2 + 3 x3
The hyperplane for the objective function cuts a bounded feasible region in the space
(x1,x2,x3). Find the direction vector d, where a finite optimal solution can be reached.

1. d(2,-5,3)
2. d(-2,5,-3)
3. d(2,5,3)
4. d(-2,-5,-3)

Answer

(B)d(-2,5,-3)

QN35. The occurrence of degeneracy while solving a transportation problem means that

1. Total supply equals total demand
2. The solution so obtained is not feasible
3. The few allocations become negative
4. None of the above

Answer

(B)The solution so obtained is not feasible

QN36. 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.

1. all constraints must be satisfied.
2. demand must equal supply.
3. we must have a number (equal to the number of rows plus the number of columns minus one) of boxes which contain nonzero quantities.
4. None of the above

Answer

(A)all constraints must be satisfied.

QN37. The Operations research technique which helps in minimizing total waiting and service costs is

1. Queuing Theory
2. Decision Theory
3. Both A and B
4. None of the above

Answer

(A)Queuing Theory

QN38. The procedure used to solve assignment problems wherein one reduces the original assignment costs to a table of opportunity costs is called __________.

1. stepping-stone method
2. matrix reduction
3. MODI method
4. northwest reduction
5. simplex reduction

Answer

(B)matrix reduction

QN39. The purpose of a dummy source or dummy destination in a transportation problem is to

1. prevent the solution from becoming degenerate.
2. obtain a balance between total supply and total demand.
3. make certain that the total cost does not exceed some specified figure.
4. provide a means of representing a dummy problem.

Answer

(B)obtain a balance between total supply and total demand.

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

1. develop the initial solution to the transportation problem.
2. assist one in moving from an initial feasible solution to the optimal solution.
3. determine whether a given solution is feasible or not.
4. identify the relevant costs in a transportation problem.

Answer

(B)assist one in moving from an initial feasible solution to the optimal solution.