Convert the following inequality constraint into an equality constraint.

110x+30y≤4000.

Select the type of the following constraint.

3x₁ + 2x₂≤ 600    

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

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

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

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

In Transportation problem is said to be unbalanced if _________. 

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

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

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