Scribd
Upload
25 views3 pages

So John Lester ISM Problem

Sarah's bakery problem involves maximizing profits from chocolate and vanilla cakes under constraints of flour, sugar, and total cake production. The linear programming model shows that producing 4 chocolate cakes and 4 vanilla cakes yields the highest profit of $48. The constraints include limits on flour (20 cups), sugar (15 cups), and total cakes (8 cakes).

Uploaded by

22-030s
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
25 views3 pages

So John Lester ISM Problem

Sarah's bakery problem involves maximizing profits from chocolate and vanilla cakes under constraints of flour, sugar, and total cake production. The linear programming model shows that producing 4 chocolate cakes and 4 vanilla cakes yields the highest profit of $48. The constraints include limits on flour (20 cups), sugar (15 cups), and total cakes (8 cakes).

Uploaded by

22-030s
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

SO JOHN LESTER

ISM

Problem:

Sarah runs a bakery that produces two types of cakes: chocolate and vanilla. Each chocolate cake earns
a profit of $5, and each vanilla cake earns a profit of $7. To bake these cakes, she requires flour and
sugar. Each chocolate cake requires 2 cups of flour and 1 cup of sugar, while each vanilla cake requires 1
cup of flour and 3 cups of sugar.

Sarah's bakery has a daily supply of 20 cups of flour and 15 cups of sugar. Due to space constraints, she
can only bake up to 8 cakes per day in total.

How many cakes of each type should Sarah bake daily to maximize her profit?

REQUIRED:

1. Linear Programming Model


2. Graph
3. Solution to the problem

DECISION :

How many cakes of each type should Sarah bake daily to maximize her profit?

OBJECTIVE

maximize her profit

Let chocolate be x

Let vanilla be y

Max 5 x + 7 y

CONSTRAINTS
. Due to space constraints (sugar, flour, number of cakes)

flour = 2 cups of flour and 1 cup of sugar

sugar = 1 cup of flour and 3 cups of sugar

has a daily supply of 20 cups of flour and 15 cups of sugar

but can bake only 8 cakes per day

flour :2 x + y <= 20
sugar : x + 3y <= 15

space = x + y <= 8

Non negative constraints

X >= 0

y>= =

GRAPH

Linear Programming Model

Cornered Points Objective Function Profit


(MAX 5 x + 7 y)

(0,0) 5 (0) + 7 (0) 0


(0,5) 5 (0) + 7 (5) 35
(4,4) 5 (4) + 7 (4) 48
(8,0) 5 (8) + 7 (0) 40

SOLUTION

The cornered points that resulted to the maximum or highest profit is (4,3)

(MAX 5 (4) + 7 (4))


20 + 28 = 48 spokening dollars
Therefore, producing 4 of Chocolate cakes and 4 of Vanilla cakes will give Sarah’s bakery a profit of 48

Cake Price Flour Sugar NO of cakes


Chocolate 5 2 1 8
Vanilla 7 1 3 8

You might also like