Question:

Match List-I with List-II regarding Linear Programming Problems (LPP):

Show Hint

A convex set means any line segment connecting two points in the set lies entirely within the set.
Updated On: Jun 12, 2026
  • (A)-(IV), (B)-(III), (C)-(I), (D)-(II)
  • (A)-(II), (B)-(III), (C)-(I), (D)-(IV)
  • (A)-(III), (B)-(IV), (C)-(II), (D)-(I)
  • (A)-(IV), (B)-(III), (C)-(I), (D)-(II)
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation


Step 1: Understanding the Concept:

LPP terminology: Constraints define the boundaries, the objective function is what we optimize, and the feasible region is the resulting space.

Step 2: Detailed Explanation:

(A) Inequalities defining limits are the Linear Constraints (IV).
(B) The function to optimize is the Linear objective function (III).
(C) The intersection area is the Feasible Region (I).
(D) In LPP, the feasible region is geometrically a Convex set (II).

Step 3: Final Answer:

The correct matching is (A)-(IV), (B)-(III), (C)-(I), (D)-(II).
Was this answer helpful?
0
0