Home › JEE Main › mathematics › Linear Programming › Maximise $Z = 3x + 2y$ over the corner points $(…
Maximise $Z = 3x + 2y$ over the corner points $(0,0),\ (4,0),\ (0,5),\ (2,3)$. The maximum value is:
A10
B15
C6
D12
Answer & Solution
Correct answer: D. 12
Evaluate Z=3x+2y: (0,0)→0, (4,0)→12, (0,5)→10, (2,3)→12. Maximum = 12.
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