Operations Research Set 11

Bachelor of Computer Applications (BCA),

Bachelor of Management Studies (BMS)

Practice Mode Previous
On This Page

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

Q1 | How many methods are there to solve LPP?
  • Three
  • Two
  • Four
  • None of the above
Answer: Two
Q2 | An assumption that implies that finite numbers of choices are available to a decision –maker and the decision variables do not assume negative values is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Certainty
  • Continuity
  • Finite choices
  • None of the above
Answer: Finite choices
Q3 | A set of values X1, X2,…Xn which satisfies the constraints of the LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐
  • Solution
  • Variable
  • Linearity
  • None of the above
Answer: Solution
Q4 | A basic solution which also satisfies the condition in which all basic variables are non ‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Basic feasible solution
  • Feasible solution
  • Optimal solution
  • None of the above
Answer: Basic feasible solution
Q5 | All the constraints are expressed as equations and the right hand side of each constraint andall variables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Canonical variable
  • Canonical form
  • Canonical solution
  • Both A and B
Answer: Canonical form
Q6 | Currently, LPP is used in solving a wide range of practical ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Business problems
  • Agricultural problems
  • Manufacturing problems
  • None of the above
Answer: Business problems
Q7 | 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
Answer: (i) only
Q8 | 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
Answer: (i) only
Q9 | MODI method is used to obtain ‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Optimal solutions
  • Optimality test
  • Both A and B
  • Optimization
Answer: Both A and B
Q10 | To make an unbalanced assignment problem balanced, what are added with all entriesas zeroes?
  • Dummy rows
  • Dummy columns
  • Both A and B
  • Dummy entries
Answer: Both A and B
Q11 | Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum(rim requirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Linear programming
  • Basic feasible solution
  • Feasible solution
  • None of the above
Answer: Feasible solution
Q12 | A feasible solution is called a basic feasible solution if the number of non‐negative allocationsis equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
  • m‐n+1
  • m‐n‐1
  • m+n‐1
  • None of the above
Answer: m+n‐1
Q13 | Any feasible solution to a transportation problem containing m origins and n destinationsis said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Independent
  • Degenerate
  • Non‐degenerate
  • Both A and B
Answer: Non‐degenerate
Q14 | Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐from O origins and D destinations
  • Goods
  • Products
  • Items
  • None of the above
Answer: Goods
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
Answer: Balanced problem
Q16 | 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
Answer: Unshipped supply, Shortage
Q17 | In which phase is optimization done and how does that phase also checks foroptimality conditions?
  • Phase II
  • Phase I
  • None of the above
Answer: Phase II
Q18 | Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐
  • Time taken
  • Partial cost
  • Total cost
  • None of the above
Answer: Total cost
Q19 | 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
Answer: One only
Q20 | The allocated cells in the transportation table are called ‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Occupied cells
  • Empty cells
  • Both A and B
  • Unoccupied cells
Answer: Both A and B
Q21 | VAM stands for ‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Vogeal’s Approximation Method
  • Vogel’s Approximate Method
  • Vangel’s Approximation Method
  • Vogel’s Approximation Method
Answer: Vogel’s Approximation Method
Q22 | If the total supply is less than the total demand, a dummy source (row) is included in thecost matrix with ‐‐‐‐‐‐‐‐‐‐‐‐‐
  • Dummy Demand
  • Dummy Supply
  • Zero Cost
  • Both A and B
Answer: Zero Cost
Q23 | To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐
  • LPP
  • VAM
  • MODI Method
  • Rim
Answer: MODI Method
Q24 | For maximization in TP , the objective is to maximize the total ‐‐‐‐‐‐‐‐‐‐
  • Solution
  • Profit Matrix
  • Profit
  • None of the above
Answer: Profit
Previous