Example (the classic two-decision problem): Case Chemicals produces two solvents: CS-01 and CS-02. Each 1000 gallons of CS-01 yields a net profit of $300 and requires 2 hours in the Blending Department and 1 hour in the Purification Department. Each 1000 gallons of CS-02 yields a net profit of $500 and requires 1 hour in the Blending Department and 2 hours in the Purification Department. Given 230 available hours in the Blending Department and 250 available hours in the Purification Department next week, what is the optimal amount of CS-01 and CS-02 to produce? (Assume fractions of gallons may be produced; the solution need not be a multiple of 1000 or even integer.) Question 1: Formulate this linear program (LP) algebraically identify the decision variables, objective function, and constraints using variables and mathematics). Question 2: Draw the lines corresponding to the constraints on the axes below. Shade the feasible region and identify iso-profit line and all "corner points" (also called "extreme points")