Practicing Success
CUET Preparation Today
CUET
-- Mathematics - Section A
Linear Programming
For the LPP Max =z = ax + by (a, b > 0) with feasible region as shown, z will be :
Maximum at (2, 0)
No maximum value
Maximum at (0, 0)
Maximum at (2, 5)