Operations Research Online MCQ Set 10

QN01. The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because

  1. It improve the total cost
  2. It does not disturb rim conditions
  3. It ensure feasible solution
  4. All of the above
Answer

(C)It ensure feasible solution

QN02. The solution to a transportation problem with â — rows (supplies) & †— columns (destination) is feasible if number of positive allocations are

  1. m+n
  2. m*n
  3. m+n-1
  4. m+n+1
Answer

(C)m+n-1

QN03. The transportation method assumes that

  1. there are no economies of scale if large quantities are shipped from one source to one destination.
  2. 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.
  3. there is only one optimal solution for each problem.
  4. the number of dummy sources equals the number of dummy destinations.
Answer

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

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

  1. Programme Evaluation
  2. Review Technique (PERT)
  3. Both A and B
  4. Deployment of resources
Answer

(C)Both A and B

QN05. What have been constructed from OR problems an methods for solving the models that are available in many cases?

  1. Scientific Models
  2. Algorithms
  3. Mathematical Models
  4. None of the above
Answer

(C)Mathematical Models

QN06. What is the difference between minimal cost network flows and transportation problems?

  1. The minimal cost network flows are special cases of transportation problems
  2. The transportation problems are special cases of the minimal cost network flows
  3. There is no difference
  4. 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

QN07. What is the objective function in linear programming problems?

  1. A constraint for available resource
  2. An objective for research and development of a company
  3. A linear function in an optimization problem
  4. A set of non-negativity conditions
Answer

(C)A linear function in an optimization problem

QN08. When total supply is equal to total demand in a transportation problem, the problem is said to be

  1. Balanced
  2. Unbalanced
  3. Degenerate
  4. None of the above
Answer

(A)Balanced

QN09. Which of the following is a method for improving an initial solution in a transportation problem?

  1. northwest-corner
  2. intuitive lowest-cost
  3. southeast-corner rule
  4. stepping-stone
Answer

(D)stepping-stone

QN10. Which of the following is NOT needed to use the transportation model?

  1. the cost of shipping one unit from each origin to each destination
  2. the destination points and the demand per period at each
  3. the origin points and the capacity or supply per period at each
  4. degeneracy
Answer

(D)degeneracy

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

  1. Formulating a problem
  2. Constructing a model
  3. Establishing controls
  4. Controlling the environment
Answer

(D)Controlling the environment

QN12. Which of the following is used to come up with a solution to the assignment problem?

  1. MODI method
  2. northwest corner method
  3. stepping-stone method
  4. Hungarian method
  5. none of the above
Answer

(D)Hungarian method

QN13. Which of the following methods is used to verify the optimality of the current solution of the transportation problem

  1. Least cost method
  2. Vogel's approximation method
  3. Modified distribution method
  4. All of the above
Answer

(C)Modified distribution method

QN14. Which of these statements about the stepping-stone method is best?

  1. 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.
  2. Only squares containing assigned shipments can be used to trace a path back to an empty square.
  3. An improvement index that is a net positive means that the initial solution can be improved.
  4. Only empty squares can be used to trace a path back to a square containing an assigned shipment
Answer

(B)Only squares containing assigned shipments can be used to trace a path back to an empty square.

QN15. Which statement characterizes standard form of a linear programming problem?

  1. Constraints are given by inequalities of any type
  2. Constraints are given by a set of linear equations
  3. Constraints are given only by inequalities of >= type
  4. Constraints are given only by inequalities of <= type
Answer

(A)Constraints are given by inequalities of any type

QN16. Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost reduction under certain constraints?

  1. Quailing Theory
  2. Waiting Line
  3. Both A and B
  4. Linear Programming
Answer

(D)Linear Programming

QN17. Who defined OR as scientific method of providing execuitive departments with a quantitative basis for decisions regarding the operations under their control?

  1. Morse and Kimball (1946)
  2. P.M.S. Blackett (1948)
  3. E.L. Arnoff and M.J. Netzorg
  4. None of the above
Answer

(A)Morse and Kimball (1946)

QN18. With the transportation technique, the initial solution can be generated in any fashion one chooses. The only restriction is that

  1. the edge constraints for supply and demand are satisfied.
  2. the solution is not degenerate.
  3. the solution must be optimal.
  4. one must use the northwest-corner method.
Answer

(A)the edge constraints for supply and demand are satisfied

ed010d383e1f191bdb025d5985cc03fc?s=120&d=mm&r=g

DistPub Team

Distance Publisher (DistPub.com) provide project writing help from year 2007 and provide writing and editing help to hundreds student every year.