Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
+1 vote
903 views
in Linear Programming by (58.3k points)

Maximise Z = x + y, subject to x – y ≤ -1, -x +y ≤ 0, x, y ≥ 0.

1 Answer

+1 vote
by (53.1k points)
selected by
 
Best answer

x – y = -1

x 1 0 2
y 2 1 3

0 – 0 -1 False 

x + 2y = 6

x 0 4 2
y 3 1 2

0 + 0  0 False, 

Since there is no common shaded region, there is no feasible solution region. 

Hence maximum of Z does not exist.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...