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

Maximise z=8x+9y subject to the constraints given below :
2x+3y6;3x2y6;y1;x0;y0

Open in App
Solution

Given constraints are
2x+3y6
3x2y6
y1
x,y0
For graph of 2x+3y6
We draw the graph of 2x+3y=6
x 0 3
y 2 0

Putting Origin in the equation, we get:
2×0+3×06(0,0) satisfy the constraints.
Hence, feasible region lie towards origin side of line.
For graph of 3x2y6
We draw the graph of line 3x2y=6.
x 0 2
y 3 0
Putting Origin in the equation, we get:
3×02×06 Origin (0,0) satisfy 3x2y=6.
Hence, feasible region lie towards origin side of line.
For graph of y1
We draw the graph of line y=1, which is parallel to xaxis and meet yaxis at 1.
Putting Origin in the equation, we get:
01 feasible region lie towards origin side of y=1.
Also, x0,y0 says feasible region is in Ist quadrant
Therefore, OABCDO is the required feasible region, having corner point O(0,0), A(0,1), B(32,1), C(3013,613), D(2,0).
Here, feasible region is bounded. Now the value of objective function Z=8x+9y is obtained as.
Corner Points Z=8x+9y
O(0,0) 0
A(0,1) 9
B(32,1) 21
C(3013,613) 22.6
D(2,0) 16
Z is maximum when x=3013 and y=613.
1638715_1782715_ans_3b98ae26ded44385ac9ec28b7c07fd9f.jpg

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