Question

Solve the following problem by graphical method
Min Z = 2X1 + 3X2
subject to
X1 >= 125
X1 + X2 >=350
2x1 + x2 <=600
X1, X2 >=0​

Answer 1

Answer:

The graph of linear programming problem is as given below

Hence the required feasible region is given by the graph whose vertices are and

Thus objective function is minimum at

So and

Solution Image