Home › JEE Main › mathematics › Linear Programming › Minimise $Z = x + y$ over the corner points $(5,…
Minimise $Z = x + y$ over the corner points $(5,0),\ (0,4),\ (1,1)$. The minimum value is:
A4
B5
C0
D2
Answer & Solution
Correct answer: D. 2
Evaluate Z=x+y: (5,0)→5, (0,4)→4, (1,1)→2. Minimum = 2.
Related questions
If a feasible region of an LPP is empty, the problem isHungarian method for assignment problem requires the cost matrix to beAssignment problem is a special case ofMaximise Z = 3x + 2y subject to x + y ≤ 4, x ≥ 0, y ≥ 0. Maximum value of Z isIn LPP, optimal solution (if it exists) is found atThe feasible region of an LPP isIn a linear programming problem (LPP), the objective function isA linear program has an unbounded feasible region. The maximisation of the objective funct