Only question V

THERE ARE 3 QUESTIONS. TOTAL 70 POINTS. 1. [25 Pt.1 [DO NOT USE EXCEL TO SOLVE THIS PROBLEM An optimization programming model is formulated as follows: Max. Z = x + 2y s.t. 3x + y 2 3 x + 3y 2 2 - x +2y = 2 5x + y s 15 2x - y s4 x,y 20 and the constraints in the model are illustrated in a plot as B E . G H K L (i) [5 Pt.) As an LP problem, identify the feasible solution area and shade the area in any color on the graph. Operations Management (MGT 4310 880) SPRING 2021 Instructor: Dr. Mehmet Turkoz Name: WP-ID: (ii) [5 Pt.] Which points are the extreme points? Find the coordinates of each extreme point. (iii) [5Pt.] In the feasible solution area in (i), identify all the possible integer solution points as an IP problem. (iv) [5 Pt.] Based on (iii), compute the optimal objective value Zip in LP. (v) [5 Pt.] Based on (iii), compute the optimal objective value and Zip in IP