Marcus has an online following and business in which he makes custom key caps for people who are really into customizing their keyboards. He is a one-man shop and has high demand. He has two versions of key caps made of two different resins. Resin one (1) uses 2 cups of part A and 3 cups of part B and makes 3 key caps. These caps sell for 50$. Resin two (2) uses 2 cups of part B and 1.5 cups of part C and makes 4 key caps. These caps sell for $30 each. How many batches of each type of resin should he make to maximize profit. He has 15 cups of Part A and C and 25 cups of part B.

X1 - # of batches of resin 1

X2 - # of batches of resin 2

Max Z = (3*50)X1 + (4*30)*X2

St.

2X1 < 15 Part A

3X1 + 2X2 < 25 Part B

1.5X2 < 15 Part C

In the problem 2 worksheet, prepare a table for solving Marcus optimization problem. Use Solver to solve Marcus optimization problem. Marcus cannot make partial batches. Make sure you include two constraints in Solver to make X1 and X2 integers. Highlight the maximum profit blue, batches of resin 1 to produce in orange, batches of resin 2 to produce in green.