Matching Optimization Methods to Problem Types

This question requires matching specific optimization and operations research methods (List-I) with the types of problems they are designed to solve (List-II).

List-I Method Descriptions:

• A. Branch and Bound Method: This is a systematic algorithm used primarily for solving optimization problems, particularly when the decision variables must be integers.
• B. The North-West Corner Rule: This is a simple heuristic method used as a first step to find an initial feasible solution for a specific type of logistics problem.
• C. Lagrange Multiplier Method: This is a mathematical technique used to find the local maxima and minima of a function subject to equality constraints.
• D. Wolfe's Modified Method: This is an algorithm developed specifically to solve a particular class of non-linear programming problems with a quadratic objective function.

List-II Problem Type Descriptions:

• I. Integer Programming Problem (IPP): Problems where the variables are restricted to be integers.
• II. Quadratic Programming Problem (QPP): Problems with a quadratic objective function and linear constraints.
• III. Transportation Problem: A logistics problem focused on minimizing the cost of transporting goods from sources to destinations.
• IV. Non-Linear Programming Problem: Problems where the objective function or constraints (or both) are non-linear.

Correct Matching Analysis:

• A. Branch and Bound Method is correctly matched with I. Integer Programming Problem.
• B. The North-West Corner Rule is correctly matched with III. Transportation Problem.
• C. Lagrange Multiplier Method is a technique applicable to general constrained optimization, including IV. Non-Linear Programming Problem.
• D. Wolfe's Modified Method is specifically designed for II. Quadratic Programming Problem.

Therefore, the correct matching is A-I, B-III, C-IV, D-II.