1. What is the objective function equation for this problem assuming X1 = Supreme and X2 = Basic?
2. What are the constraint equations for this problem? (Use box at right for writing constraints)

3. a) Plot/label the constraints and shade feasible space on the graph on next page

4. What are the possible combinations/ revenues of the salads that could be produced? Place a star (*) next to or highlight the Optimal Choice.

(Use box at right for writing answers;

include any supporting math on next page)

5.Which constraint(s) (if any) is/are binding?

6. Which constraints) (if any) are redundant?

7.How much slack or surplus do the non-binding constraints have (not including the non-negativity constraints)? You must note if it's SLACK or SURPLUS. Support with math on next page.

Math Work Area: Question 3 (graphing coordinates math): Question 4 (simulataneous equation math as needed): Question 7 (slack/surplus math as needed): Wes and Steve offer 2 salads for their lunch trucks - the Supreme ($7 profit =x1) and the Basic ( $5 profit =x2). Each salad requires 2 processes to create: CHOPPING and PREPARATION (shown in table below). Each salad requires LETTUCE as indicated below. Steve and Wes want to know how many of each salad to produce each day to maximize profit-but they are adamant that no more than 15 SUPREME salads should be produced (due to profit margins)