Question:

Consider the following statement in context of Linear Programming Problem \(LPP\): A. It has an objective function, B. It allows negative values of decision variable always, C. Its Feasible region is usually a polygon, D. Its Constraint must be linear, E. Its Optimal solution lies at corner point.

Show Hint

In LPP, the objective function and constraints are linear, and the feasible region is formed by linear inequalities.
Updated On: May 22, 2026
  • A, C, D Only
  • A, B, D, E Only
  • A, C, E Only
  • A, B, C, D, E
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

Concept: Linear Programming Problem is a mathematical technique used to optimize an objective function subject to linear constraints.

Step 1:
Check statement A.
Every LPP has an objective function which is either maximized or minimized. \[ A = \text{Correct} \]

Step 2:
Check statement B.
LPP usually includes non-negativity restrictions. Decision variables are generally not allowed to be negative. \[ x\geq 0,\quad y\geq 0 \] \[ B = \text{Incorrect} \]

Step 3:
Check statement C.
In two-variable graphical LPP, feasible region is generally a polygon formed by linear inequalities. \[ C = \text{Correct} \]

Step 4:
Check statement D.
Constraints must be linear in a linear programming problem. \[ D = \text{Correct} \]

Step 5:
Check statement E.
The optimal solution is associated with corner points in graphical method, but among the given option combinations, the suitable correct set given is \(A, C, D\). Therefore, the correct answer is: \[ A, C, D \]
Was this answer helpful?
0
0

Top CUET PG Economics Questions

View More Questions

Top CUET PG Mathematical Methods in Economics Questions

View More Questions