On This Page

This set of Operations Research Multiple Choice Questions & Answers (MCQs) focuses on Operations Research Set 8

Q1 | An optimum solution is considered the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ among feasible solutions.
  • Worst
  • Best
  • Ineffective
  • None of the above
Q2 | Please state which statement is true.(i) All linear programming problems may not have unique solutions (ii) The artificial variable technique is not a device that does not get the starting basic feasible solution.
  • Both (i) and( ii)
  • (ii) only
  • (i) only
  • Both are incorrect
Q3 | Please state which statement is incorrect.(i) Linear programming was first formulated by an English economist L.V. Kantorovich (ii) LP is generally used in solving maximization or minimization problems subject to certain assumptions.
  • (ii) only
  • (i) only
  • Both (i) and( ii)
  • Both are correct
Q4 | ‐‐‐‐‐‐‐‐‐‐‐‐ which is a subclass of a linear programming problem (LPP)
  • Programming problem
  • Transportation problem
  • Computer problem
  • Both are incorrect
Q5 | The solution of any transportation problem is obtained in how many stages?
  • Five
  • Four
  • Three
  • Two
Q6 | An optimal solution is the ‐‐‐‐‐‐‐‐‐‐‐ stage of a solution obtained by improving the initial solution
  • Third
  • First
  • Second
  • Final
Q7 | MODI method is used to obtain ‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Optimal solutions
  • Optimality test
  • Both A and B
  • Optimization
Q8 | For solving an assignment problem, which method is used?
  • Hungarian
  • American
  • German
  • Both are incorrect
Q9 | To make an unbalanced assignment problem balanced, what are added with all entries aszeroes?
  • Dummy rows
  • Dummy columns
  • Both A and B
  • Dummy entries
Q10 | Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum (rimrequirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Linear programming
  • Basic feasible solution
  • Feasible solution
  • None of the above
Q11 | A feasible solution is called a basic feasible solution if the number of non‐negative allocations isequal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • m‐n+1
  • m‐n‐1
  • m+n‐1
  • None of the above
Q12 | Any feasible solution to a transportation problem containing m origins and n destinations issaid to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Independent
  • Degenerate
  • Non‐degenerate
  • Both A and B
Q13 | A path formed by allowing horizontal and vertical lines and the entire corner cells of which areoccupied is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Occupied path
  • Open path
  • Closed path
  • None of the above
Q14 | Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ fromO origins and D destinations
  • Goods
  • Products
  • Items
  • None of the above
Q15 | If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Simple problem
  • Balanced problem
  • Transportation problem
  • None of the above
Q16 | Basic cells indicate positive values and non‐ basic cells have ‐‐‐‐‐‐‐‐‐‐‐ value for flow
  • Negative
  • Positive
  • One
  • zero
Q17 | According to transportation problem number of basic cells will be exactly ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • m+n‐0
  • n+m‐1
  • m+n‐1
  • None of the above
Q18 | Before starting to solve the problem, it should be balanced. If not then make it balanced by ‐‐‐‐‐‐‐‐‐‐‐ column incase demand is less than supply or by adding ‐‐‐‐‐‐‐‐‐‐‐‐ raw incase supply is less than the demand
  • O,D
  • m,n
  • Horizontal, Vertical
  • Unshipped supply, Shortage
Q19 | In which phase is optimization done and how does that phase also checks for optimalityconditions?
  • Phase II
  • Phase I
  • None of the above
Q20 | Optimality conditions are expressed as ‐‐‐‐‐‐‐‐‐‐‐‐‐ incase all non‐basic cells?
  • Negligent costs
  • Advanced costs
  • Reduced costs
  • None of the above
Q21 | A ‐‐‐‐‐‐‐‐‐ has rows / column having non‐ basic cells for holding compensating (+ )or (‐) sign.
  • Cycle
  • Dead – end
  • Back track
  • None of the above
Q22 | After determining every basic cell with in this cycle, adjustment is obtained as minimum valuein basic cells . this is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Adjustment amount
  • aa
  • Both A and B
  • Alternatives
Q23 | Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐
  • Time taken
  • Partial cost
  • Total cost
  • None of the above
Q24 | State which of the two statements is correct(i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
  • both (i) and (ii) are correct
  • Two only
  • One only
  • Both (i) and (ii) are incorrect
Q25 | The allocated cells in the transportation table are called ‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Occupied cells
  • Empty cells
  • Both A and B
  • Unoccupied cells