wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Solve the following linear programming problem graphically :
Minimise Z=200x+500y...(1)
subject to the constraints:
x+2y10...(2)
3x+4y24...(3)
x0,y0...(4).

Open in App
Solution

The shaded region in Fig is the feasible region ABC determined by the system of constraints (2) to (4), which is bounded. The coordinates of corner points
Corner PointCorresponding value of Z
(0,5)2500
(4,3)2300Minimum
(0,6)3000
A,B and C are (0,5),(4,3) and (0,6) respectively. Now we evaluate Z=200x+500y at these points.
Hence, minimum value of Z is 2300 attained at the point (4,3).

818359_846589_ans_2dec6fa3fb30486f8737360aa65ef632.jpg

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