Solve the following Linear Programming Problem graphically:
Maximize: z=-x+2y, subject to the constraints: x≥3, x+y≥5,x+2y≥6, y≥0.
This question is exactly same as Ex 12.1, 9 - Chapter 12 Class 12
Please check https://www.teachoo.com/5411/758/Ex-12.1--9---Maximise-Z---x---2y-subject-to-x---3--x---y---5/category/Ex-12.1/