Mathematics PROJECT

Topic: linear programming

•Submitted to: RAKESH SIR

•Submitted by: KALASH KR.
•ROLL NUMBER: 26
 Certificate
• This is to certificate that:
• Kalash Kumar of Class 12 A of Nirmala
Convent High School has completed his
project on the topic linear programming
under the supervision of Rakesh sir
 Acknowledgement
• I would like to express my special thanks of
gratitude to my teacher Rakesh sir who gave me
the golden opportunity to do this wonderful
project on the topic linear programming, which
also helped me in doing a lot of Research and I
came to know about so many new things I am
really thankful to them.
Secondly I would also like to thank my parents
and friends who helped me a lot in finalizing this
project within the limited time frame.
 index
• Introduction
• Characteristics of linear programming
• Methods to solve linear programming
• Question
 Introduction
• Linear programming (LP), also called linear optimization, is a
method to achieve the best outcome (such as maximum profit or
lowest cost) in a mathematical model whose requirements are
represented by linear relationships. Linear programming is a special
case of mathematical programming (also known as mathematical
optimization).
• More formally, linear programming is a technique for
the optimization of a linear objective function, subject to linear
equality and linear inequality constraints. Its feasible region is
a convex polytope, which is a set defined as the intersection of
finitely many half spaces, each of which is defined by a linear
inequality. Its objective function is a real-valued affine (linear)
function defined on this polyhedron. A linear
programming algorithm finds a point in the polytope where this
function has the smallest (or largest) value if such a point exists.
 Characteristics of Linear Programming

• The following are the five characteristics of the linear programming

problem:
• Constraints – The limitations should be expressed in the
mathematical form, regarding the resource.
• Objective Function – In a problem, the objective function should be
specified in a quantitative way.
• Linearity – The relationship between two or more variables in the
function must be linear. It means that the degree of the variable is
one.
• Finiteness – There should be finite and infinite input and output
numbers. In case, if the function has infinite factors, the optimal
solution is not feasible.
• Non-negativity – The variable value should be positive or zero. It
should not be a negative value.
• Decision Variables – The decision variable will decide the output. It
gives the ultimate solution of the problem. For any problem, the
first step is to identify the decision variables.
Methods to solve linear programming
• The most important part of solving linear programming
problem is to first formulate the problem using the given
data. The steps to solve linear programming problems are
given below:
• Step 1: Identify the decision variables.
• Step 2: Formulate the objective function. Check whether
the function needs to be minimized or maximized.
• Step 3: Write down the constraints.
• Step 4: Ensure that the decision variables are greater than
or equal to 0. (Non-negative restraint)
• Step 5: Solve the linear programming problem using either
the simplex or graphical method.
• The linear programming problem is - =100x+20y, Constrains are- . and x,y.
• Given,
• There are some dietary requirements of the staple food of the adolescent
students of some schools.
• To Find,
• (1) 2 food items including one pulse and one cereal.
• (2)The minimum cost of one pulse and one cereal.
• (3) The formulated version of the corresponding linear programming
problem.
• (4)The problem graph,
• Solution,
• We can solve this mathematical linear programming problem using the
method.
• At first let's assume that the 2 food items be, Wheat and arhar dal or pigeon
peas.
• The rate of Wheat is Rs. 20 per kg and the rate of Arhar dal is Rs. 100 per kg.
• So, we need to minimize the 100x+20y.
• We know protein in arhar dal is 220gm / kg and in wheat 100gm/kg.
• Carbohydrate in arhar dal is 630gm / kg and in wheat 760gm/kg.
• Suppose the dietary requirements of adolescent
students are as below,
• The requirement for protein is 60gm
• Carbohydrate is 1500gm.
• So we can formulate our corresponding linear
programming problem as follows,
• =100x+20y
• Constrains are-
• 220x+100y>=60
• 630x+760y>=1500
• and x,y>=0
• Hence, the answers are as follows- The two food items
including one pulse and one cereal are Wheat and
Arhar dal/ pigeon peas. The arhar dal is Rs.100/kg and
wheat is Rs. 20/kg. The linear programming problem is
- =100x+20y, Constrains are-
220x+100y=>60,630x+760y=>1500 and x,y>=0