BHOLANANDA NATIONAL

VIDYALAYA
55 & 56, BARRACK ROAD, BARRACKPORE
KOLKATA – 700 120

A.I.S.S.C.E MATHEMATICS
PROJECT
TOPIC OF PROJECT: COLLECTION OF DATA
FROM DIETITIANS, TRANSPORTERS AND
SO ON AND FORM A LINEAR
PROGRAMMING PROBLEM
NAME: AKASH GHOSH
CLASS: XII SCIENCE
BOARD ROLL NO:
YEAR: 2019-20
 ACKNOWLEDGEMENT

I take the opportunity to extend my gratitude to our

mathematics teacher Mrs. Shrabani Ganguly for her
advice at each step during the making of this project
and providing all necessary facilities to conduct the
project. Without her help and cooperation, completing
this project would have been impossible. I have
successfully completed this project work.

I am grateful to our principal ma’am Mrs. Swati Rudra

for providing us a platform like this school to lead us
forward in our life. I am also thankful to all my
classmates for their kind help and cooperation.
 CERTIFICATE OF EFFORT

This is to certify that AKASH GHOSH, a student of class

XII Science, roll no:- , has performed the
project work on “COLLECTION OF DATA FROM
DIETITIANS, TRANSPORTERS AND SO ON AND
FORMING LINEAR PROGRAMMING PROBLEM” under
my supervision as schedule with syllabus of
mathematics for practical.
A.I.S.S.C.E--2019-20

____________________ ____________________
Signature of teacher Signature of principal
(Mrs Shrabani Ganguly) (Mrs Swati Rudra)

_________________
(Signature of external)
 INTRODUCTION
Optimization is the way of life. We all have finite
resources and time and we want to make the most of
them. From using your time productively to solving
supply chain problems for your company – everything
uses optimization. It’s a especially interesting and
relevant topic in data science.
Linear programming (LP) is one of the simplest ways to
perform optimization. It helps us to solve some very
complex optimization problems by making a few
simplifying assumptions. As an analyst one is bound to
come across applications and problems to be solved by
Linear Programming.
Linear programming is used for obtaining the most
optimal solution for a problem with given constraints.
In linear programming, we formulate our real life
problem into a mathematical model. It involves an
objective function, linear inequalities with subject to
constraints.
 PROCEDURE

AIM :- In order to ensure optimal health (and thus accurate test

results), a lab technician needs to feed the rabbits a daily diet
containing a minimum of 24 grams (g) of fat, 36 g of carbohydrates, and
4 g of protein. But the rabbits should be fed no more than five ounces of
food a day.

Rather than order rabbit food that is custom-blended, it is cheaper to

order Food X and Food Y, and blend them for an optimal mix. Food X
contains 8 g of fat, 12 g of carbohydrates, and 2 g of protein per ounce,
and costs $0.20 per ounce. Food Y contains 12 g of fat, 12 g of
carbohydrates, and 1 g of protein per ounce, at a cost of $0.30 per
ounce.

What is the optimal blend?

SOLUTION:-
Since the exercise is asking for the number of ounces of each food
required for the optimal daily blend, my variables will stand for the
number of ounces of each:

x: number of ounces of Food X

y: number of ounces of Food Y

Since I can't use negative amounts of either food, the first two constrains
are the usual ones: x > 0 and y > 0. The other constraints come from the
grams of fat, carbohydrates, and protein per ounce:
 fat: 8x + 12y > 24
carbs: 12x + 12y > 36
protein: 2x + 1y > 4

Also, the maximum weight of the food is five ounces, so:

x+y<5

The optimization equation will be the cost relation C = 0.2x + 0.3y,

but this time I'll be finding the minimum value, not the maximum.

After rearranging the inequalities, the system graphs as:

When the corners at (0, 4), (0, 5), (3, 0), (5, 0), and (1, 2) are tested a
minimum cost of sixty cents per daily serving, using three ounces of
Food X only is obtained.

CONCLUSION:- A diet using three ounces of food X which costs sixty

cents per daily serving is required for the rabbits.