7-19 (b) Solve by the Corner Point Graphical solution (identify the feasible area and label the corner points.

7-19 (page 293) (a) LP Model Formulation (name your variables as Xi and X2) Let Xi = number of Alpha 4 minicomputers * = number of Beta 5 minicomputers. Maximize profit = $ 1, 200x, + $1,800x2 subject to: 2041 + 25x2 800 hours X1 2 10 X2 2 15 non-negative constraints y , 2 0 X220 7-19 (b) Solve by the Corner Point Graphical solution (identify the feasible area and label the corner points) X1 Show your calculation steps for your graph below: Show your calculation steps for the corner points below: Evaluate the corner points: Corner point (label) (X1 , Xz) Profit (show your profit calculation steps) The optimal solution is which yields a maximum profit of $