Answer Happy

Q2. LINEAR PROGRAMMING (Minimization problem) (a) Solve the following LP model GRAPHICALLY by drawing all the constraints. Next, draw a specific objective function (i.e., a specific Iso-cost line to start with) assuming an arbitrary value of the objective function. (b) Show the feasible area on the graph. Minimize Cost $28X+$24Y (Iso-Cost Line) s.t. (1) 5X + 4Y ≤ 2600 (2) X+Y ≥ 300 (3) X ≥ 80 (4) Y > 100 X, Y Z 0 Indicate (label) the corner points on the graph and you may evaluate the objective function to verify that your graphical solution is consistent with your corner-point optimal solution. (c) Find the optimal solution (graphically using the ISOCOST LINE) and calculate the optimal (minimum) value). (d) SHOW YOUR WORK.