CUET Preparation Today
CUET
-- Mathematics - Section B1
Linear Programming
The linear programming problem \(Z=5x+7y\) subject to the constraints \(x+y\leq 6, 2x+3y\geq 3, x\geq 3, y\geq 3\) then \(Z\) is
Always minimum
Always maximum
either maximum or minimum
Infinite
⇒ Either maximum or minimum