Solve the following Linear Programming by graphical method. Find the feasible region first, then the optimal solution should be one of the corners/extreme points. For portraying the constraint 3x1-x23x1-x2=30. First, we let x₁=13.33 (40/3), then we get x₂= 10; second we let x₂=0, then we get x₁=10. By connecting the two points (13.33, 10) and (10, 0), we can portray the cutting line for the constraints 3x1-x230.

What is the optimal solution?

What are the corners?

Max 101 + 3x2 s, t. X2 X 10 3x1 + 42