[NOTE: We, Lea Nizelle Hernandez, Molena Manocan, and Micaela Paredes of BSA 2-

2 divided our tasks and compared our answers together. Thank you so much po.]
PROBLEM STATEMENT
The Crumb and Custard Bakery makes coffee cakes and Danish pastries in large pans.
The main ingredients are flour and sugar. There are 25 pounds of flour and 16 pounds
of sugar available, and the demand for coffee cakes is 5. Five pounds of flour and 2
pounds of sugar are required to make a pan of coffee cakes, and 5 pounds of flour and
4 pounds of sugar are required to make a pan of Danish. A pan of coffee cakes has a
profit of $1, and a pan of Danish has a profit of $5.
Determine the number of pans of cakes and Danish to produce each day so that profit
will be maximized.
a. Formulate a linear programming model for this problem.
b. Solve this model by using graphical analysis.

Resource Requirement
Product Flour Sugar
Coffee Cakes 5 2
Danish Cakes 5 4

Maximize Z = $1x1 + $5x2

where:
Z = total profit
x1 = a pan of coffee cakes
x2 = a pan of Danish

Maximize Z = $1x1 + $5x2

subject to
5x1 + 5x2 ≤ 25
2x1 + 4x2 ≤ 16
x1 ≤ 5
x1, x2 ≥ 0
Constraint 1 – flour
Constraint 2 – sugar
Constraint 3 – demand for coffee cakes
Constraint 4 and 5 – all values must be integer
Based on the graph analysis provided above, the optimal point suggest that at 4 pans of
Danish, it will maximize a profit of 20.

In the problem, how much flour and sugar will be left unused if the optimal
numbers of cakes and Danish are baked?
QM for Windows provided that the Crumb and Custard Bakery should produce
four pans of Danish pastries, for the business to reach its maximum profit. Thus:
Flour = 25 – [4(5)]
= 5lbs
Sugar = 16 – [4(4)]
=0
Only 5lbs of flour will remain and all of the sugar will be used.