Solve the following linear programming problem by any means


Maximise: 5x + 3y
subject to: x + 2y ≤ 6
                     x + y ≤ 8
                     2x + y ≤ 10
                      x, y  ≥ 0


 
	a.	Maximum is 40 which occurse at ( 5, 5)
 
	b.	Maximum is 25, which occurs at ( 5, 0)
 
	c.	Maximum is 15 which occous at ( 5, 0 )
 
	d.	There is no feasible region
What is the correct answer?



