make many decision and profitable: Current Situation: Wes and Steve offer 2 salads for their lunch trucks - the Supreme ($9 revenue =x1) and the Basic ($7 revenue =x2). Each salad requires 2 processes to create: A and B (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 revenues - but they are adamant that no less than 10 basic salads should be produced (due to profit margins). For Completion on Page 2 \& 3: - Using the information in the paragraph and table above, complete the model documentation, graphing. mathematics and answer questions as requested. Important Notes: - You must show all work or you will receive ZERO points. You cannot just write answers. This means: If are using a graphing calculator, you STILL must show all work. - You must round to 2 decimal points. - You must write neatly and NOT in red ink. - You are not permitted to cross out answers; use white-out or start over. - If I cannot read your work, you will receive zero points. Instructions: Ieproduce bv hand or complete vis computer, Rezarde ew vou isiuc note answers in the space provided ONLY. All weportinis thath (round to 2 decimal po ritur mast be shown int the When completed: take a photo of this and next ance OWi y/save file and upload via the corresponding Asuznment ink in Canvas by the due date, Remember: No HeIC files are permitted. YOU CAN INCLUDE MATH WORK ON PAGE 2 IN APPROPRIATE SPACES 1. What is the objective function equation/ statement for this problem assuming X3= Supreme and X2= Basic? (1 pt) 2. What are the constraint equations for this problem? (Use box at right for writing constraints) (2 pts) 3. Plot/label the constraints on the graph on page 2 and shade the feasibfe solution space (3 pts) Show work \& graphing on Page 2. Be sure to write NEATLY - if I cannot read it: zero points. 4. What are the possible combinations/ revenues of the salads that could be produced? Place a star () next to, highlight, or circle the Optimal Choice. (5 pts) (Use box at right for writing answers: include any supporting math on next page) 5. Which constraint(s) (if any) is/are binding? State LETTER not equation! (1 pt) 6. Which constraint(s) (if any) are redundant? State LETTER not equationl (1 pt) 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. ( 2 pts) Math Work Area: Question 3 (show all work for graphing coorcinates math): Question 4 (show all work for simulataneous equation math): Question 7 (slack/surplus math as needed)
