1. [30 Pt.) A linear programming problem is given as follows: Minimize Z = -4x + x2 Subject to 8x + 2x2 16 4x, + 2x, 512 x 55 *2 S2 *.x220 1 [5 Pt.] Find the A, B, C, D and E, F, G, H, K points on the plot below. (ii) (5 P.) Identify the feasible solution area graphically on the following plot (by shading the area) E D A B G (0,0) K H iii) [5 Pt.] Which points are the extreme points? Ev) [5 Pt.] What is the solution of the optimization problem? (x1=?,x2?.z=?) Show your work. - [5 Pt.) Which change will make the problem have multiple optimal solutions? If there is more than one answer, choose all. a) Increase of the coefficient of X, on the objective function to 4 b) Increase of the coefficient of x, on the objective function to 2 c) Decrease of the coefficient of x, on the objective function to -8 d) Increase of the coefficient of x2 on the objective function to-8 e) None