class 12 maths linear programming

Maximise and minimise $Z = 3x - 4y$ subject to $x - 2y \le 0,$ $- 3x + y \le 4$ $x - y \le 6$ and $x,$ $y \ge 0$.

VAVidaara Admin Asked 8d ago 0 views 0 answers
📘 Linear Programming NCERT,Exemp,Q.25,Page,254 SA

Maximise and minimise $Z = 3x - 4y$ subject to $x - 2y \le 0,$ $- 3x + y \le 4$ $x - y \le 6$ and $x,$ $y \ge 0$.

Official Solution

VVidaara Team ✓ Verified solution NCERT & Exemplar

Given LPP is, maximise and minimise $Z = 3x - 4y$

subject to $x - 2y \le 0,$ $- 3x + y \le 4,$ $x - y \le 6,$ $x,$ $y \ge 0$.

[on solving $x - y = 6$ and $x - 2y = 0$,

we get $x = 12,y = 6$]

figure

From the shown graph, for the feasible region,

we see that it is unbounded and coordinates of corner points are (0,0),(12,6) and (0,4).

figure

For given unbounded region the minimum value of Z may or may not be -16. So,

for deciding this, we graph the inequality.

$3x - 4y < - 16$

and check whether the resulting open half plane has common points with feasible region or not.

Thus, from the figure it shows it has common points with feasible region,

so it does not have any minimum value.

Also, similarly for maximum value, we graph the inequality $3x - 4y > 12$

and see that resulting open half plane has no common points with the feasible region

and hence maximum value 12 exist for $Z = 3x - 4y$.

Objective Questions

View the full step-by-step solution page & related questions →

Community Answers (0)

Log in to post your own answer or join the discussion.

Discussion (0)

No comments yet — start the discussion.

← Back to all questions