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

Minimize Z = -3x + 4y, subject to constraints are x+2y8, 3x+2y12,x0 and y0.

Open in App
Solution

Our problem is to minimize

Z = -3x + 4y .........(i)

Subject to constraints x + 2y 8 .......(ii)

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

x 0, y 0 .............(iv)

Firstly, draw the graph of the line, x + 2y = 8

x08y40

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

0+0808 (which is true)

So, the half plane is towards the origin.

Since, x, y 0

So, the feasible region lies in the first quadrant.

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

x04y60

Putting (0, 0) in the inequality 3x + 2y 12, we have 3×0+2×012

012 (which is true)

So, the half plane is towards the origin.

Feasible region is OABCO.

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

Intersection point B is (2, 3)

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

Corner pointZ=3x+4yO(0, 0)0A(4, 0)12MininumB(2, 3)6C(0,4)16

Therefore, the minimum value of Z is -12 at the point A(4, 0).


flag
Suggest Corrections
thumbs-up
34
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