class 12 maths linear programming

Maximize $Z = x + y,$ subject to$x - y \le - 1, - x + y \le 0,x,y \ge 0$ .

VAVidaara Admin Asked 9d ago 0 views 0 answers
📘 Linear Programming NCERT,Ex.12.1,Q.10,page.513 SA

Maximize $Z = x + y,$ subject to$x - y \le - 1, - x + y \le 0,x,y \ge 0$ .

Official Solution

VVidaara Team ✓ Verified solution NCERT & Exemplar

.: The system of constraints is :

$x - y \le - 1$ …(1)

$- x + y \le 0$ ….(2)

$x,y \ge 0$ ….(3)

Let ${l_1}:x - y = - 1; \& {l_2}; - x + y = 0$

figure

Clearly, there is no feasible region.
[ There is no common region]

Hence, there is no maximum value of Z

Exercise - 12.2

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