LP Formulation ONLY (Formulate this problem as a linear programming formulation with notation.)

a) A boutique chocolatier - Lafayette Village Raleigh has two most sellable products: Its flagship assortment of triangular chocolates, called Pyramide, and the more decadent and deluxe Pyramide Nut and Caramel.

How much of each should it produce to maximize profits?

Every box of Pyramide has a profit of $1.

Every box of Nut and Caramel has a profit of $6.

The daily demand is limited to at most 200 boxes of Pyramide and 300 boxes of Nut and Caramel.

The current workforce can produce a total of at most 400 boxes of chocolate per day.

Let x1 be # of boxes of Pyramide, x2 be # of boxes of Nut and Caramel

b) What if there is a third and even more exclusive line of chocolates, called Pyramide Luxe. One box of these will bring in a profit of $13.

Nut and Caramel and Luxe require same packaging machinery, except that Luxe uses it three times as much, which imposes another constraint x2 + 3x3 600.