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
0 votes
5.0k views
in Linear Programming by (58.4k points)

Maximise Z = -x + 2y, subject to the constraints: x ≥ 3, x + y ≥ 5 , x + 2y ≥ 6, y ≥ 0

1 Answer

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

x + y = 5

x 1 3 2
y 4 2 3

0 + 0

False 

0  3 False

x + 2y = 6

x 0 4 2
y 3 1 2

0 + 0  False 

ABC is the solution region 

At A (3,2) Z =-3+2 x 2=1 

At B (4,1) Z = -4 + 2 x 1 = -2 

At C (6, 0) Z = -6 = -6 

Z is maximised at A (3, 2) = 1 and 

minimised at C (6, 0) = -6

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

...