Definition of LPP:

Linear programming is a method of optimizing 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 constraints in the form of linear equations or in the form of
inequalities. Linear programming is considered an important technique that is used to find the
optimum resource utilization. The term “linear programming” consists of two words as linear and
programming. The word “linear” defines the relationship between multiple variables with degree
one. The word “programming” defines the process of selecting the best solution from various
alternatives.

OR

Generally, LPP is called for optimization (maximization/minimization). A linear function of a

variable is called the objective function, subject to a set of linear equations or inequalities called
the constraints or restrictions.

Key elements of LPP:

Objective function-

The objective function is the mathematical expression that needs to be maximized or minimized.

Max/Min z = a1x1 +a2x2 + a3x3 +……..+ anxn

The objective function describes the primary purpose of the formulation of an LPP, and it is always
non-negative. In business applications, the profit function, which is to be maximized, or the cost
function, which is to be minimized, is called the objective function.

Constraints:

The inequations or equations in the variables of a LPP which describe the condition under which
optimization (maximization/minimization) is to be accomplished are called constraints.

Constraints contains may be one of the three signs (≤, ≥, =)

Decision Variables

Identify the variables that represent decisions to be made. Let x 1, x2,..., xn represent these
decision variables.

Non-negativity Constraints

Decision variables in LP problems are usually non-negative.

x1 ≥ 0, x2 ≥ 0

Ques 1. A firm manufactures two types of products A & B and sells them at a profit of Rs.
2 on type A and Rs. 3 on type B. Each product is produced on two machines G and H. Type
A requires 1 min of processing time on G and 2 min of processing time on H and for type B
1 min on G and 1 min on H.
The machine G is available for not more than 6 hours 40 minutes while machine H is
available for not more than 10 hours during any working day. Formulate the problem as
LPP.
Solution:

Machine A(x1) B(x2) Time (Minutes)

G 1 1 400
H 2 1 600
Profit 2 3

Let x1 be the no. of products on type A.

And, x2 be the no. of products on type B.
The profit on type A is Rs. 2 per product then the profit will be 2x 1.
Similarly, on type B the profit will be 3x 2. Hence the total profit-
Z = 2x1 + 3x2
Now, Machine G take 1 min on type A and 1 min on type B. But machine G is not available for
more than 400 minutes then total time required for Machine G is:
x1 + x2 ≤ 400,
Similarly for machine H:
2x1 + x2 ≤ 600
(These equation are called subject to constraints). So subject to constraints
x1 + x2 ≤ 400,
2x1 + x2 ≤ 600
It is not possible to produce negative quantity. Hence x 1 , x2 ≥ 0 (Restriction)
(Max/Min) Z = 2x1 + 3x2 (Objective function)
subject to constraints
x1 + x2 ≤ 400,
2x1 + x2 ≤ 600
x1 , x2 ≥ 0 (Restriction)
This is called LPP.
Ques 2. A manufacturer of patent medicines is preparing a production plan on medicines A
and B. There are sufficient raw materials available to make 20,000 bottles of A and 40,000
bottles of B, but there are 45,000 bottles into which either of the medicines can be put.
Further, it takes 3 hours to prepare enough material to fill 1000 bottles of A, it takes 1 hours
to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this
operation. The profit is Rs. 8 per bottle for A and Rs. 7 per bottle for B. Construct the
maximization problem.
Solution:
Suppose the manufacture produces x1 bottles of medicine A and x2 bottles of medicine B.
Since profits on each bottle of A and B are Rs. 8 & Rs. 7 per bottle respectively. So, profit on x 1
bottles of A and x2 bottles of B are 8x1 and 7x2 respectively.
Let Z be the total profit on bottles so,
Z= 8x1 + 7x2
Since 1000 bottles of medicine A are prepared in 3 hours.
1000 bottles =3 Hours
1 bottle = 3/1000 Hours
x1 bottles = 3x1/1000 hours.
So, time required to prepare x1 bottles of medicine A= 3x1 /1000 hours.
Similarly,
1000 bottles = 1 Hours
1 bottle = 1/1000 Hours
x2 bottles = x2/1000 Hours.
Since 1000 bottles of medicine B are prepared in 1 hours.
So, time required to prepare x2 bottles of medicine B= x2/1000 hours
Thus, total time required to prepare x 1 bottles of medicine A and x2 bottles of medicine B is 3x1
/1000+ x2/1000 hours, But the total time available for this operation is 66 hours.
3x1 /1000+ x2/1000≤ 66 or 3x1 + x2 ≤ 66,000.
Since, raw materials are available to make 20,000 bottles of A and 40,000 bottles of B, but there
are 45,000 bottles into which either of the medicines can be put so,
x1≤ 20,000, x2≤ 40,000, x1 +x2 ≤ 45,000, with x1, x2 ≥ 0.
So mathematical formulation of the given LPP is
Max Z =8x1 + 7x2
Subject to constraints
3x1 + x2 ≤ 66,000,
x1≤ 20,000,
x2≤ 40,000,
x1 +x2 ≤ 45,000,
x1 , x2 ≥ 0.
Ques 3. A factory produces two product P1 and P2. Each of the product P1 requires 2 hrs
for moulding, 3 hrs for grinding and 4 hrs for polishing, and each of the product P2 requires
4 hrs for moulding, 2 hrs for grinding and 2 hrs for polishing. The factory has moulding
machine available for 20 hrs, grinding machine for 24 hrs and polishing machine available
for 13 hrs. The profit is Rs. 5 per unit of P1 and Rs 3 per unit of P2 and the factory can sell
all that it produces. Formulate the problem as a linear programming problem to maximize
the profit.
Solution:
Product P1(x1) P2(x2) Time (Minutes)
Resources
Moulding 2 4 20
Grinding 3 2 24
Polishing 4 2 13
Profit in Rs. 5 3

Max Z =5x1 +3 x2
Subject to constraints
2x1 +4x2 ≤ 20,
3x1 +2x2 ≤ 24,
4x1 +2x2 ≤ 13,
x1 , x2 ≥ 0.
Ques 4. A toy company manufactures two types of doll; a basic version doll A and a deluxe
version doll B. Each doll of type B takes twice as long to produce as one of type A and the
company would have time to make a maximum of 2000 dolls of type A per day. The supply
of plastic is sufficient to produce 1500 dolls per day and each type requires an equal amount
of each. The deluxe version requires a fancy dress of which there are only 600 per day
available. If the company makes profit Rs. 3 and Rs. 5 per doll respectively for doll A and
doll B; how many of each should be produced per day in order to maximize profit?
Solution:
Let x dolls of type A and y dolls of type B be produced per day. Then,
Total profit =3x +5y.
Since each doll of type B takes twice as long to produce as one of type A, therefore total time taken
to produce x dolls of type A and y dolls of type B is x+2y. But the company has time to make a
maximum of 2000 dolls per day, so
x+2y≤ 2000
Max Z =3x +5y.
Subject to constraints
x+2y≤ 2000
x1 +y ≤ 1500,
y≤ 600,
x1 , x2 ≥ 0.

Methods for finding the solutions of LPP:-

i) Graphical method
ii) Iterative method or simplex method
Graphical method for finding the solutions of LPP:-
Since it is difficult to draw a graph for more than two variables, the graphical method can be used
to solve linear programming problem involving only two variables. The method essentially
involves indicating the constraints on the graph and determining the feasible region, which are
feasible, i.e. those solutions, which satisfy all the constraints of the problem.
Feasible Solution:- A set of values of the variables x1, x2, …, xn is called a feasible solution of a
LPP. If it satisfies the constraints and non-negativity restrictions of the problem.
In other words, a solution that also satisfies the non-negativity restrictions of a LPP, is called a
feasible solution.
Infeasible Solution:- A solution of a LPP is an infeasible solution, if it does not satisfy the non-
negativity restrictions.
Feasible Region:- The common region determined by all the constraints of a LPP is called the
feasible region and every point in this region is a feasible solution of the given LPP.
Optimal Feasible solution:- A feasible solution of a LPP is said to be an optimal feasible
solution, if it also optimizes (maximizes or minimizes) the objective function.

Conner-Point method graphical method

Step I. Formulate the given LPP in mathematical form if it is not so.
Step II. Convert all inequations into equations and draw their graphs. To draw the graph of a linear
equation, put y = 0 in it and obtain a point on the x-axis. Similarly, by putting x = 0 obtain a point
on the y-axis. Join these two points to obtain the graph representing the equation.
Step III. Determine the region represented by each inequation. To determine the region
represented by an inequation replace x and y both by zero, if the inequation reduces to a valid
statement, then the region containing the origin is the region represented by the given inequation.
Otherwise, the region not containing the origin is the region represented by the given inequation.
STEP IV
Obtain the region in xy-plane containing all points that simultaneously satisfy all constraints
including non-negativity restrictions. The polygonal region so obtained is the feasible region and
is known as the convex polygon of the set of all feasible solutions of the LPP.
STEP V
Determine the coordinates of the vertices (corner points) of the convex polygon obtained in Step
II. These vertices are known as the extreme points of the set of all feasible solutions of the LPP.
STEP VI
Obtain the values of the objective function at each of the convex polygons. The point where the
objective function attains its optimum (Maximum/ Minimum) values is the optimal solution of the
given LPP.