INDEX

LINEAR PROGRAMMING
Introduction:
From 1946 to 1947 George B.
Dantzig independently developed general linear programming
formulation to use for planning problems in the US Air Force. In
1947, Dantzig also invented the simplex method that, for the
first time efficiently, tackled the linear programming problem in
most cases.
Linear programming, mathematical modeling
technique in which a linear function is maximized or minimized
when subjected to various constraints.
This technique has been useful for guiding
quantitative decisions in business planning, in industrial
engineering, and—to a lesser extent—in the social and physical
sciences.
Linear Programming (LP) is a widely used
mathematical techniques designed to help. managers in
planning and decision making relative to resource allocations. It
is a. mathematical method for determining a way to achieve
the best outcome in a given.10 Mar 2016.

Seven characteristics of all linear

programming models:
(1) objective function,
(2) decision variables,
(3) constraints,
(4) feasible region,
(5) parameters
(6) linearity, And(7)non negativity.
 LINEAR PROGRAMMING PROBLEM

Maximise the linear function Z subject to certain conditions

determined by a set of linear inequalities with variables as non-negative.
There are also some other problems where we have to
minimise a linear function subject to certain conditions determined by a
set of linear inequalities with variables as non-negative. Such problems
are called Linear Programming Problems.
Thus, a Linear Programming Problem is one that is concerned
with finding the Optimal value (maximum or minimum value) of a linear
function (called objective Function) of several variables (say x and y),
subject to the conditions that the variables Are non-negative and satisfy
a set of linear inequalities (called linear constraints).
The term linear implies that all the mathematical relations used in the
problem are Linear relations while the term programming refers to the
method of determining a Particular programme or plan of action

Linear Programming Formula

The objective function, Z, is the linear function that needs to be
optimized (maximized or minimized) to get the solution.
The constraints are the restrictions that are imposed on the decision
variables to limit their value.
The decision variables must always have a non-negative value which is
given by the non-negative restrictions.
The general formula of a linear programming problem is given below:
Objective Function: Z = ax + by

Constraints: cx + dy ≤ e, fx + gy ≤ h. The
inequalities can also be "≥"
Non-negative restrictions: x ≥ 0, y ≥ 0
 Method of solving
linear programming problems
There are three types/methods for solving LPP that are ;
1. Graphical method
2. Simplex Method
3. Big M Method

Graphical Method
Graphical method of linear programming is used to solve
problems by finding the highest or lowest point of intersection
between the objective function line and the feasible region on a
graph.
The graphical method can be broken down into the following 7
steps:
Step 1: Define Constraints
Step 2: Define the Objective Function
Step 3: Plot the constraints on a graph paper
Step 4: Highlight the feasible region on the g
Step 5: Plot the objective function on the graph
Step 6: Find the optimum point
Step 7: Find the coordinates of the optimum point
Example 1: Solve the given linear programming problems
graphically:
Maximize: Z = 8x + y
Constraints are,
X + y ≤ 402x + y ≤ 60x ≥ 0, y ≥ 0
Solution:
Step 1: Constraints are,
X + y ≤ 402x + y ≤ 60x ≥ 0, y ≥ 0
Step 2: Draw the graph using these constraints.

Here both the constraints are less than or equal to, so they
satisfy the below region (towards origin). You can find the
vertex of feasible region by graph, or you can calculate using
the given constraints:
X + y = 40 …(i)
2x + y = 60 …(ii)
Now multiply eq(i) by 2 and then subtract both eq(i) and (ii), we
get
Y = 20
Now put the value of y in any of the equations, we get
X = 20
So the third point of the feasible region is (20, 20)
Step 3: To find the maximum value of Z = 8x + y. Compare
each intersection point of the graph to find the maximum val

So the maximum value of Z = 240 at point x = 30, y = 0.

Simplex Method
Simplex method is an approach to solving linear programming
models by hand using slack variables, tableaus, and pivot
variables as a means to finding the optimal solution of an
optimization problem
Step 1: Insert slack variables and find slack equations.
Step 2: Rewrite the objective function and put it below the slack
equations.
Step 3: Write the initial simplex tableau.
Step 4: Find the pivot element by finding the most negative
indicator in last row and using the smallest quotient rule.
Step 5: Perform the pivot operation.
Step 6: Are there any more negative indicators in the last row?
If Yes, Go to Step 4, Else the maximum has been reached.
 DAILY LIFE PROBLEMS

PROBLEM 1:
A company produces two types of TVs, one
is black and white, while the other is colour. The company has
the resources to make at most 200 sets a week. Creating a
black and white set costs Rs. 2700 and Rs. 3600 to create a
coloured set. The business should spend no more than Rs.
648000 a week producing TV sets. If it benefits from Rs. 525
per set of black and white and Rs. 675 per set of colours, How
many sets of black/white and coloured sets should it produce in
order to get maximum profit? Formulate this using LPP.

Solution: Let x and y be the number of black/white and

coloured TVs, respectively

Subject to constraints:

x, y ≥ 0 (Non-negative constraint)
x + y ≤ 200 (Quantity constraints)

2700x + 3600y ≤ 648000 (Cost constraints)

Objective function: Z = 525x + 675y (objective is to

maximize profit)

Feasible region R are bounded as shown in the figure above.

Thus maximum value of Z occurs at C(80,120), i.e., 123000. So

the company should manufacture 80 black/white and 120
coloured TV sets to get maximum profit

PROBLEM 2:
A health enthusiast wishes to mix two types of foods in his diet,
in such a way that vitamin content of the mixture contains at
least 10 units of vitamin B and 13 units of vitamin C. Food (F1)
contains 1 unit/kg of vitamin B and 2 units/kg of vitamin C.
Food (F2) contains 2 unit/kg of vitamin B and contains 1 unit/kg
of vitamin C. F1 costs Rs 60/kg and F2 costs Rs 80/kg. Frame
his diet plan making a linear programming problem in order to
minimize the cost of the mixture.
Solution: Let x and y represent the number of units of vitamin B
and C, respectively.
Subject to constraints:
X, y ≥ 0 (Non-negative constraints)
X + 2y ≥ 10 (Vitamin B constraint)
2x + y ≥ 13 (Vitamin C constraint)
Objective function: Z = 60x + 80y (objective is to minimize cost)
Feasible region R unbounded as shown in the figure above.

Therefore, the minimum value of Z occurs at C(9,2) i.e. 700. So the

person should mix 9 kg of food (F1) and 2 kg of food (F2) to obtain
a minimum cost.
 CONCLUSION

In Mathematics, linear programming is a method of optimising operations

with some constraints.
The main objective of linear programming is to maximize or minimize the
numerical value.
It consists of linear functions which are subjected to the constraints in
the form of linear equations or in the form of inequalities.
Conclusion. Linear programming is a powerful method for solving
optimization problems in data science.
It offers a flexible and powerful way to find the best solution to a wide
range of problems, making it a useful tool for making data-driven
decisions.
 BIBLIOGRAPHY

 NCERT maths text book

 www.byjus.com
 WWW.testbook.comwww.testbook.com

THANK YOU