CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Minimize Z = 3x + 5y, subject to constraints are x + 3y 3, x+y2 and x, y 0.

Open in App
Solution

Our problem is to minimize Z = 3x + 5y .........(i)

Subject to constraints x + 3y 3 .........(ii)

x + y 2 .........(iii)

x 0, y 0 ...(iv)

Firstly, draw the graph of the line x + 3y = 3

x03y10

Putting (0, 0) in the inequality x + 3y 3, we have

0+3×0303 (which is false)

So, the half plane is away from the origin. Since, x, y 0

So, the feasible region lies in the first quadrant.

Secondly, draw the graph of the line x + y = 2

x02y20

Putting (0, 0) in the inequality x + y 2, we have 0 + 0 2, 0 2 (which is false)

So, the half plane is away from the origin. It can be seen that the feasible region is unbounded.

On solving equations x + y = 2 and x + 3y = 3, we get

x=32 and y=12

Intersection point B(32,12)

The corner points of the feasible region are O(0, 0), A(3, 0), B(32,12) and C(0, 2). The values of Z at these points are as follows :

Corner pointZ=3x+5yO(0, 0)0A(3, 0)9B(32,12)7MininumC(0, 2)10

As the feasible region is unbounded therefore, 7 may or may not be the minimum value of Z.

For this, we draw the graph of the inequality, 3x+5y<7 and check whether the resulting half plane has points in common with the feasible region or not.

It can be seen that the feasible region has no common point with 3x + 5y < 7.

Therefore, the minimum value of Z is 7 at (32, 12).


flag
Suggest Corrections
thumbs-up
9
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Types of Linear Programming Problem
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon