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
2.7k views
in Linear Programming by (50.4k points)
closed by

Minimise Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0.

1 Answer

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

Given: Z = 13x – 15y subject to the constraints: x + y ≤ 7, 2x – 3y + 6 ≥ 0, x ≥ 0, y ≥ 0.

Taking x + y = 7, we have

Now, plotting all the constrain equations we see that the shaded area OABC is the feasible region determined by the constraints.

The feasible region is bounded with four corners O(0, 0), A(7, 0), B(3, 4) and C(0, 2).

So, the maximum value can occur at any corner.

On evaluating the value of Z, we get

From the above table it’s seen that the minimum value of Z is -30.

Therefore, the minimum value of the function Z is -30 at (0, 2).

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

...