Linear

Programming
 LINEAR
PROGRAMMING
 What is LP ?
 The word linear means the relationship which can

be represented by a straight line .i.e the relation is of the

form
ax +by=c. In other words it is used to describe the relationship between two or more
variables which are proportional
to each other
The word “programming” is concerned with the
optimal allocation of limited resources.
Linear programming is a way to handle certain types of optimization problems
Linear programming is a mathematical method for determining a way to
achieve the best outcome
 What is LPP ???

• Optimization technique
• To find optimal value of objective function, i.e.
maximum or minimum
• “LINEAR” means all mathematical functions
are required to be linear…
• “PROGRAMMING” refers to Planning, not
computer programming…
 What is graphical method ???
• One of the LPP method
• Used to solve 2 variable problems of LPP…
 Steps for graphical
method…
FORMULATE THE OUTLINE THE
PROBLEM SOLUTION AREA
( for objective & ( area which satisfies
constraints functions) the constraints)

CIRCLE POTENTIAL
FRAME THE GRAPH PLOT THE GRAPH SOLUTION
( one variable on ( one variable on POINTS
horizontal & other at horizontal & other ( the intersection
vertical axes) at vertical axes) points of all
constraints)

PLOT THE CONSTRAINTS

(inequality to be as equality; SUBSTITUTE & FIND
give arbitrary value to variables OPTIMIZED SOLUTION
& plot the point on graph )
 LET US TAKE AN EXAMPLE!!!
SMALL SCALE
ACCOMPLISHED BY BUT NUMBER OF
ELECTRICAL
SKILLED MEN & WORKERS
REGULATORS
WOMEN WORKERS CAN’T EXCEED
INDUSTRY
11

SALARY BILL NOT MALE WORKERS ARE DATA COLLECTED

MORE THAN Rs. PAID Rs.6,000pm & FOR THE
60,000 pm FEMALE WORKERS ARE PERFORMANCE
PAID Rs.5,000pm

DATA INDICATED MALE MEMBERS DETERMINE No. OF MALES &

CONTRIBUTES Rs.10,000pm & FEMALES TO BE EMPLOYED IN
FEMALE MEMBERS CONTRIBUTES ORDER TO MAXIMIZE TOTAL
Rs.8,500pm RETURN
 STEP 1-FORMULATE THE PROBLEM
Objective Function :-
Let no. of males be x & no. of females be y
Maximize Z = Contribution of Male members +
contribution of Female members
Max Z = 10,000x + 8,500y
Subjected To Constraints :-
x + y ≤ 11 ………..(1)
6,000x + 5,000y ≤ ………..(2)
60,000
 STEP 2- FRAME THE GRAPH
• Let no. of Male Workers(x) be on horizontal axis
& no. of Female Workers (y) be vertical axis..

No. of
females

No. of males
 STEP 3- PLOT THE CONSTRAINTS
• To plot the constraints, we will opt an arbitrary
value to the variables as:-
x + y ≤ 11:- converting as x + y = 11
x 0 11
y 11 0
6,000x+5,000y≤60,000:- converting as 6x + 5y=
60
x 0 10
y 12 0
 STEP 4- PLOT THE GRAPH
No. of No. of
females females
14 14
( 0 , 11 ) 12 ● ( 0 , 12 )
12
10 ● 10
8 8
6 6
4 4
2 ( 11 , 0 ) 2 ( 10 , 0 )

0
● 0
●
No. of 2 4 No. of
2 4 6 8 10 12 6 8 10 12
males males
x+y ≤ 6x + 5y ≤60
11
STEP 5- FIND THE OPTIMAL SOLUTION
No. of females

12 ● OPTIMAL
● SOLUTION POINT
10

8
( 5, 6 )
6 ●
4 FEASIBLE
2
REGION

0 ● ●
2 4 6 8 No. of males
10 12
STEP 6- CIRCLE POTENTIAL OPTIMAL
POINTS
No. of females

12
( 0,
11 )
10

8 ( 5, 6 )
6

2 ( 10 , 0 )

0
( 0, 2 4 6 8 10 12 No. of males
0)
STEP 7- SUBSTITUE & OPTIMIZE

Max Z = 10,000x + 8,500y

POTENTIAL Z = 10,000x + 8,500y MAXIMUM Z

OPTIMAL PTS.
(0,0) 10,000(0) + 8,500(0) 0
(0,11) 10,000(0)+8,500(11) 93,500
(5,6) 10,000(5)+8,500(6) 11,0,011,,00000
0
(10,0) 10,000(10)+8,500(0) 1,00,000
 CONCLUSIO
• N total return is about
Thus, maximum
Rs.1,01,000 by adopting 5 male workers & 6
female workers.
• Hence, optimal solution for LPP is :-
No. of male workers

= 5 No. of female
workers = 6
Max. Z
 Let us take other example!!!
• Find the maximum value of objective function
Z= 4x + 2y
s.t. x + 2y ≥ 4
3x + y ≥
7
-x + 2y ≤
7
&x≥0&
y≥0
 PLOT THE CONSTRAINTS
x 0 4
x + 2y = 4
y 2 0

x 0 7/3
3x + y = 7 y 7 0

x 0 -7
-x + 2y = 7
y 7/2 0
 PLOTTING
CONSTRAINTSTO
GRAPH
 x 0 4
x + 2y ≥ 4
y 2 0

Y 67
5
4
3
2
(0,
1
• (4,0)
02 ) •4 5 7
1 2 3 6
X
3x + y ≥ 7 x 0 7/3
y 7 0

(0,7)

Y 67
5
4 •
3
2
• ( 7/3 , 0
1 )

0
4 5 6 7
1 2 3
X
 x 0 -7
-x + 2y ≤ 7 y 7/2 0

7 Y
6
( 0 , 7/2 5
4
3
)

( -7 , 0 )
• 2
1

• 0
-7 -6 -5 -4 -3
-2 -1
X
There is a common portion or common points which
intersects by all 3 regions of lines

3x + y ≥ 7

-x + 2y ≤ 7

Y 67
5
x + 2y ≥ 4
4
3
2
1

0
1 2 3 4 5 6 7
-7 -6 -5 -4 -3 -2 -1
X
CIRCLE THE POTENTIAL POINTS!!!

Y 67
(1,4)
5
4
3
2 (2,1)
1
( 4 ,0 )
0
1 2 3 4 5 7
-7 -6 -5 -4 -3 -2 -1 6 X
STEP 7- SUBSTITUE & OPTIMIZE

Max Z = 4x + 2y

POTENTIAL Z = 4x + 2y MAXIMUM Z
OPTIMAL PTS.

(1,4) 4(1) + 2(4) 12

(2,1) 4(2)+2(1) 10

(4,0) 4 (4)+ 2(0) 1166

 CONCLUSIO
N
Hence, the optimal solution is:
X=4
Y=0
Max z = 16
 PRACTICE QUESTIONS
(1)Maximize
… f(x) = x1 + 2x2
subject to: x1 + 2x2 ≤
3
x1 + x2 ≤ 2
x1 ≤ 1
&
subject to: 4x+6y≥12
x1 , x2 2x+4y≤4
& x≥0 ; y≥0
≥0
(2) Maximize z = 4x+2y
THANK
YOU !!!