Q80.Marks: +2.0UGC NET Paper 2: Computer Science 2nd January 2026 Shift 1
Match the LIST-I with LIST-II
LIST-I (Name of Methods)
LIST-II (Problem Type)
A. Branch and bound method
I.
Integer Programming Problem
B. The North-west corner rule
II.
Quadratic Programming Problem
C. Lagrange Multiplier Method
III.
Transportation Problem
D. Wolfe’s Modified Method
IV.
Non-Linear programming problem
Choose the correct answer from the options given below:
1.A-III, B-II, C-IV, D-I
2.A-I, B-III, C-IV, D-II✓ Correct
3.A-II, B-I, C-IV, D-III
4.A-IV, B-I, C-II, D-III
Solution
The correct answer is A-I, B-III, C-IV, D-II.
Key Points
The Branch and Bound Method is primarily used to solve Integer Programming Problems efficiently by systematically exploring all possible solutions and eliminating suboptimal solutions.
The North-West Corner Rule is a method for obtaining an initial feasible solution to a Transportation Problem, focusing on the top-left corner allocation.
The Lagrange Multiplier Method is used to solve Non-Linear Programming Problems by optimizing a function subject to constraints.
Wolfe’s Modified Method is specifically designed for solving Quadratic Programming Problems, which involve optimizing a quadratic objective function with linear constraints.
Additional Information
Branch and Bound Method:
Works by dividing the problem into smaller subproblems (branches) and determining bounds for optimality.
Widely used for discrete optimization problems.
North-West Corner Rule:
Provides a basic feasible solution but does not guarantee optimality.
Used as the starting point for optimization methods like the stepping stone or MODI method.
Lagrange Multiplier Method:
Uses auxiliary variables (multipliers) to incorporate constraints into the objective function.
Applicable in economics and engineering optimization problems.
Wolfe’s Modified Method:
Efficiently solves quadratic programming problems, especially in machine learning (e.g., SVMs).
Involves converting the problem into a linear format for iterative optimization.
