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

Solve each of the following linear programming problems by graphical method.

Minimize Z = 5x + 3y

Subject to :

2x + y ≥ 10

x + 3y ≥ 15

x ≤ 10

y ≤ 8

x, y ≥ 0

1 Answer

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

Given,

Objective function is: Z = 5x + 3y

Constraints are:

2x + y ≥ 10

x + 3y ≥ 15

x ≤ 10

y ≤ 8

x, y ≥ 0

First convert the given inequations into corresponding equations and plot them:

2x + y ≥ 10 → 2x + y = 10 (corresponding equation)

Two coordinates required to plot the equation are obtained as:

Put, x = 0 ⇒ y = 10 (0, 10) - - - - first coordinate.

Put, y = 0 ⇒ x = 5 (5, 0) - - - - second coordinate

Join them to get the line.

As we know, Linear inequation will be a region in the plane, and we observe that the equation divides the XY plane into 2 halves only, so we need to check which region represents the given inequation,

If the given line does not pass through origin then just put (0, 0) to check whether inequation is satisfied or not. If it satisfies the inequation origin side is the required region else the other side is the solution.

Similarly, we repeat the steps for other inequation also and find the common region.

For a line passing through origin, we put any other coordinate to check the region.

x + 3y ≥ 15 → x + 3y = 15 (corresponding equation)

Put x = 0 ⇒ y = 5 coordinate - - - - (0, 5)

Put y = 0 ⇒ x = 15 coordinate - - - - (15, 0)

x = 0 is the y - axis and y = 0 is the x - axis

y = 8 (line parallel to x - axis passing through (0, 8))

x = 10 (line parallel to x – axis passing through (10, 0))

Hence, we obtain a plot as shown in figure:

The shaded region in the above figure represents the region of feasible solution.

Now to maximize our objective function, we need to find the coordinates of the corner points of the shaded region.

We can determine the coordinates graphically our by solving equations. But choose only those equations to solve which gives one of the corner coordinates of the feasible region.

Solving x + 3y = 15 and 2x + y = 10 gives (3, 4)

Similarly solve other combinations by observing graph to get other coordinates.

From figure we have obtained coordinates of corners as:

(3, 4) , (10, 8), (1, 8) and (10, 5/3)

Now we have coordinates of the corner points so we will put them one by one to our objective function and will find at which point it is maximum.

∵ Z = 5x + 3y

∴ Z at (3, 4) = 5 × (3) + 3 × (4) = 27

Z at (10, 8) = 5 × (10) + 3 × (8) = 74

Z at (1, 8) = 5 × (1) + 3 × 8 = 29

Z at (10, 5/3) = 5 × 10 + 3 × 5/3 = 55

We can see that Z is minimum at (3, 4) and min. value is 27

∴ Z is minimum at x = 3 and y = 4 ; and min value is 27

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

...