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

Minimize : 

z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.

1 Answer

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

First we draw the lines AB and CD whose equations are 5x + y = 5 and x + y = 3 respectively.

The feasible region is XCPBY which is shaded in the graph. 

The vertices of the feasible region are C (3, 0), P and B (0, 5). 

P is the point of the intersection of the lines 

5x + y = 5 

and x + y = 3 

On subtracting, we get

4x = 2 ∴ x = \(\frac{1}{2}\)

Substituting x = \(\frac{1}{2}\) in x + y = 3, we get

\(\frac{1}{2}\) + y = 3

∴ y = \(\frac{5}{2}\) ∴ P = \(\left(\frac{1}{2},\frac{5}{2}\right)\)

The values of the objective function z = 7x + y at these vertices are

z(C) = 7(3) + 0 = 21 

z(B) = 7(0) + 5 = 5

∴ z has minimum value 5, when x = 0 and y = 5.

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

...