For the Linear Programming model:
Maximize Z=10x1 + 6x2
subject to
3x1 + 8x2 <= 20
45x1 + 30 x2 <= 180
x1,x2 >= 0
A) Use Graphical Solution methodology to find the optimal solution of the above Linear Programming model, which means you need to find the optimal value of x1 and x2
B) Determine the optimal values of the objective function
C) Write down the Linear Programming standard form by adding slack variables