MGS | 391 Midterm Exam: Version A Question 1: LP Graphing Answer the questions directly on the exam or on a suitable piece of graph paper. Do not show calculations on this exam (no marks are given for them). Submit to the D2L dropbox. Solve the following Linear Programming problem graphically, using either the iso-profit line (of $20,000) or corner point method. Explicitly indicate the optimal solution. Ensure that you label the constraints and feasible region clearly. Please use a ruler or straight edge. State the optimal solution in words. ( You must solve for the values of the optimal solution corner points using a system of equations; it is insufficient to estimate the value from the graph.) Bloomington Brewery produces ale (A) and beer (B). They want to determine the number of barrels of ale and beer to produce to maximize profit. Maximize 200 A + 100 B Subject to Availability Hops (kg) A + 1.5 B 225 Availability Corn (kg) 3A + 2.5 B 500 VIAIAIN Max. Demand Ale A 150 Non-negativity A, B > 0 250- 200- 150 100 - 50 50 100 150 200 250