OM MCQ

Convert the following inequality constraint into an equality constraint.

110x+30y≤4000.

• ​110x+30y+s₁= 4000, where s₁ is slack variable

• ​110x+30y-s₁= 4000, where s₁ is slack variable

• ​110x+30y+s₁= 4000, where s₁ is surplus variable

• ​110x+30y+s₁= 4000, where s₁ is decision variable

​Select the type of the following constraint.

​3x₁ + 2x₂≤ 600    

• ​Equality type

• ​Inequality type

• ​Linear type

• Standard type

​Identify which operation research technique that helps in minimizing the total waiting time and servicing cost.

• ​Search method

• ​Queuing theory

• ​Decision theory

• ​Simplex method

​Name the region that is common to all the constraints including the non-negativity constraints.

• ​Feasible region

• ​Infeasible region

• ​Critical region

• ​No common region

​In a transportation problem, items are allocated from sources to destinations.

• ​at a minimum revenue

• ​at a minimum profit

• ​at a minimum cost

• ​at a maximum cost

A Transportation problem is said to be unbalanced if _________. 

• ​ total supply is not equal to total demand.

• ​total supply is greater than total demand. 

• ​total supply is lesser than total demand. 

• ​total supply is equal to total demand. 

​In Transportation problem the preferred method of obtaining either optimal or very close to the optimal solution is _____________. 

• ​North-west corner rule. 

• ​Least cost method. 

• ​Vogel’s approximation method. 

• ​Matrix method.

​Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the longest common subsequence?

• 6

• 7

• 8

• 9

​Which of the following problems should be solved using dynamic programming?

• ​Binary search

• ​Longest common subsequence

• ​Merge sort

• ​Quick sort

​Identify the method where the optimal value for Z can be obtained from corner points of the feasible region.

• ​Graphical method

• ​Direct search method

• ​Simplex method

• ​Separable method