Scribd
Upload
2 views5 pages

Math Case Study

The document outlines a case study on Linear Programming Problems (LPP) using a bakery scenario to maximize profit from cakes and puffs given time constraints. It includes data on baking time and profit, formulates the LPP with an objective function and constraints, and identifies the optimum solution of producing 0 cakes and 100 puffs for a maximum profit of ₹3000. The project also includes guidelines for structure and submission, emphasizing the importance of LPP in real-life applications.

Uploaded by

caraviias
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
2 views5 pages

Math Case Study

The document outlines a case study on Linear Programming Problems (LPP) using a bakery scenario to maximize profit from cakes and puffs given time constraints. It includes data on baking time and profit, formulates the LPP with an objective function and constraints, and identifies the optimum solution of producing 0 cakes and 100 puffs for a maximum profit of ₹3000. The project also includes guidelines for structure and submission, emphasizing the importance of LPP in real-life applications.

Uploaded by

caraviias
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
You are on page 1/ 5

Write about Linear Programming Problem.

Explain its importance and all the terms


involved in it. Describe various steps in optimization. Describe various fields of its
application in real life.
CASE STUDY
Visit your nearest Bakery and collect the information about two different items (Ex. Cakes
and
Puffs). Convert the data into LPP, solve it and get the optimum solution.
Guidelines for the project:
1. Cover page
2. Acknowledgement
3. Index
4. Introduction to the project
5. Objective or the purpose of the project.
6. Conclusion
MARKING SCHEME:
Theory Part – 5 MARKS
Case Study Part – 5 MARKS
SUBMISSION DATE – 12TH JUNE, 2025

Awesome! 🎉 Let’s now begin the Case Study section of your project — this is the practical,
real-life application of LPP using data from a bakery.

🧁 CASE STUDY: Bakery-Based Linear Programming Problem


📍 Scenario:
A local bakery sells Cakes and Puffs. The bakery owner wants to maximize profit but has
limited resources like time, ingredients, and oven space.

You visited the bakery and collected the following information:

🔢 Data Collected:
Item Time Required (minutes) Profit per Unit (₹)

Cak 2 40
e

Puff 1 30

Total available baking time per day: 100 minutes

✏️ Let’s Formulate the LPP:


Let​
x = number of cakes to be made per day​
y = number of puffs to be made per day

🔹 Objective Function (to maximize profit):


Maximize Z = 40x + 30y

🔹 Constraint (time limit):


2x + y ≤ 100

🔹 Non-negativity Conditions:
x ≥ 0, y ≥ 0

📈 Graphical Solution:
Plot the inequality 2x + y ≤ 100 and the axes constraints on a graph.​
Find the feasible region and the corner points.

Corner points (based on graph):

●​ (0, 0) → Z = 0​

●​ (0, 100) → Z = 3000​

●​ (50, 0) → Z = 2000​
✅ Optimum Solution:
To maximize profit, choose the point with the highest Z value.

📍 At (0, 100):​
Z = 40(0) + 30(100) = ₹3000 → 🔹 Maximum Profit

🟢 Conclusion of Case Study:


The bakery should produce 0 cakes and 100 puffs per day to achieve maximum profit of
₹3000, given the time constraint of 100 minutes.

Would you like the Conclusion of the overall project next? Or should we go back and do
the Index now?

You're very welcome! 😊 No worries — I’ll break it down super simply for you. Think of this
Case Study like a real situation turned into a math problem (LPP). Let’s go step by step:

🍰🎯 Real-Life Bakery LPP — Easy Version


✨ Imagine this:
You went to a bakery. They make Cakes and Puffs.

Each item takes some time to bake, and each gives some profit.

👉
But the bakery has only 100 minutes of baking time in a day. So they want to know:​
“How many cakes and puffs should we make to earn the most profit?”

📊 Data you collected:


Item Time to Bake Profit
Cak 2 minutes ₹40
e

Puff 1 minute ₹30

Total time available = 100 minutes

📌 Step 1: Define the variables


Let

●​ x = number of cakes​

●​ y = number of puffs​

📌 Step 2: Write the Objective Function (what to maximize)


👉
We want to maximize profit:​
Z = 40x + 30y

This is your objective function (Z is profit).

📌 Step 3: Write the Constraint (time limit)


Each cake takes 2 minutes, each puff 1 minute.​

👉
Total time can’t exceed 100 minutes. So:​
2x + y ≤ 100

📌 Step 4: Non-negativity
👉
You can’t make negative items:​
x ≥ 0, y ≥ 0

Now you draw this on a graph (not needed now unless your teacher asks), and check some
points that lie on the line 2x + y = 100 to see what gives the highest profit.

Try:
●​ (0, 0): No items → ₹0​

●​ (50, 0): 50 cakes → 40×50 = ₹2000​

●​ (0, 100): 100 puffs → 30×100 = ₹3000 ✅ Highest!​

✅ Final Answer (Optimum Solution):


📌 Make 0 cakes and 100 puffs​
📌 Profit = ₹3000 (this is the maximum)
Let me know if you'd like me to simplify this even more, or help you write it in a
presentation or slide format!

You might also like