LINEAR

PROGRAMING
PROBLEMS AND
IT’S APPLICATIONS
Acknowledgemen
t
Acknowledgemen
t
Acknowledgemen
t
Acknowledgemen
t
 Presenters

BISHESH PAUDEL DHAMENDRA SHAH YOGESH GAMAL

 Objectives

To know about the

linear programming
.
problems
 Objectives

To learn about
To discuss about the application of linear
linear programming
. programming
problems
 Objectives

To learn about To enhance our

To know about the application of linear presentation skill
linear programming
. programming
problems
 Objectives

To learn about To enhance our To gain the quality

To know about the application of linear presentation skill and capability of
linear programming
. programming co-ordination
.
,
problems teamwork and
communication
 Table of content

01

History and
introduction
 Table of content

02 01

Methods of linear History and

programing introduction
 Table of content

03 02 01

Application of Methods of linear History and

linear programing introduction
programming
 Table of content

04 03 02 01

Application of linear Methods of History and

Conclusion
programming linear introduction
programing
 HISTORY OF LINEAR
PROGRAMMING
 1930 AD DURING WORLD WAR II.
 DEVELOPED PRIMARILY FOR SOLVING MILITARY
LOGISTIC PROBLEMS BY LEONID KANTOVICH.
 THE METHOD WAS A SECRET UNTIL 1947: USE IN
WAR.
 AFTER WAR USED BY INDUSTRIES
INTRODUCTION OF LINEAR
PROGRAMING

? WHAT IS LINEAR PROGRAMING

 LINEAR PROGRAMING IS A MATHEMATICAL MODEL.

 USED TO FIND THE BEST OUTCOME IN A MATHRMATHICAL MODEL
 TYPICALLY REPRESENTED BY LINEAR EQUATIONS OR INEQUILITIES
 INVOLVES IN THE OPTIMIZING A LINEAR OBJECTIVE FUNCTION
 WIDELY USED IN ECONOMICS,BUSINESS MANAGEMENT,
TRANSPORTATION,MANUFACTURING AND SO ON…
 Component of linear programing
Decision Variables Objective Functions
 unknown quantities
 quantity that is to be optimized
 expected to be
estimated as an  is needed to solve
output of the LPP the optimization
solution problems
Data
Constraints
 Values
 The restrictions or
limitations  Entries
 The conditions
METHODS OF SOLVING LINEAR
PROGRAMING

Graphical method Simplex method

GRAPHICAL METHOD OF
LINRAR EQUATIONS

PROCEDURE OF SOLVING PROBLEMS

 FIX THE DECISION VARIABLES

 IDENTIFY THE OBJECTIVE FUNCTIONS
 DETERMINES THE LINEAR INEQUALITIES
 GRAPH THE SOLUTION SET OF LINEAR INEQUALITIES
 FIND THE VERTICES OF RESULTING FEASIBLE REGION
 EVALUATE THE OBJECTIVE FUNCTION IN EACH VERTICES
FIND THE EXTREME VALUES OF INEQUALITIES FROM GRAPHICAL METHOD,
OBJECTIVE FUNCTION z=30x+50y.
x+y<30,x+2y<40,x>0,y>0
Solution
The corresponding equality equation are
X+Y=30……............(i)
X+2Y=40……………..(ii)

From equation (i)

X+Y=30
If x=0 then y=30
If y=0 then x=30

The boundary line is passing from the point(0,30) and (30,0)

Now,
Taking origin as a testing point.
0+0<30
0<30
Which is true this means feasible region contain origin.

Similarly,
From equation(ii)
X+2Y=40
If x=0 then y=20
If y=0 then x=40

The boundary line passes through from the point (0,20) and (40,0)
Now,
Taking origin as a testing point
0+2*0<40
0<40
Which is true this means feasible region contain the origin
Then,
Plotting the above information in the graph,
Here the vertices are A(30,0),B(20,10),C(0,20)

Calculation of optimum values

Vertices X Y P=30X+50Y

A(30,0) 30 0 900

B(20,10) 20 10 1100

C(0,20) 0 20 1000

D(0,0) 0 0 0

Here from above table maximum value is 1100 and

the minimum value is 0
WHY SIMPLEX METHOD
OF LINEAR
PROGRAMMING IS
INTRODUCED?
Limitation of graphical method
Limited to only two variables
Feasibility for linear inequalities only
No integer solutions
Not suitable for large-scale problems
Unbounded and infeasible solutions
SIMPLEX METHOD OF
LINEAR EQUATIONS
• George B. Dantzig published
the simplex method in 1947

• original linear programming

example was to find the
best assignment of 70 people
to 70 jobs.

• faster method for optimum

solution
Procedure of solving the problem from simplex
method
Q.N. MAXIMIZE Z=7X+5Y
Subject to 4X+3Y<12, X+2Y<6, X>0, Y>0
Solution, given
Step 1
•Convert constraints to equations with slack
Adding non negative slack variables S and T
variables.
respectively to make constraints as equation
4X+3Y+S=12………(i)
Step 2
•Set up the initial simplex tableau. X+2Y+T=6…………..(ii)
-7X-5Y+Z=0.........(iii)
Basic coefficient
variable
Writing
X Ythe givenS LP in initial
T table
Z CONSTANT
S 4 3 1 0 0 12
T 1 2 0 1 0 6
Z -7 -5 0 0 1 0
 the presence of negative numbers -7 and -5 in row 3 indicates
that the initial solution given by initial table is not optimal.
Step 3 Since the most negative number is -7 so coefficient X column
•Identify the entering and indicate pivot colume and X is entering variable.
leaving variables.
Then,
Dividing the constant column by corresponding element of
pivot column i.e. , ,
Since, the most smallest positive number is 3. So, R1 is pivot
row. So, x entered departing S.

Intersection of pivot row and pivot column is pivot element

i.e 4 lies in intersection 0f pivot row and pivot column
Basic coefficient
variable X Y S T Z CONSTANT
x 4 3 1 0 0 12
T 1 2 0 1 0 6
Z -7 -5 0 0 1 0
Step 4 Dividing the pivot row by pivot element (4)
Pivot row operation and update the table. We get,
Basic coefficient
variable x y s T Z CONSTANT
x 1 3/4 1/4 0 0 3
T 1 2 0 1 0 6
Z -7 -5 0 0 1 0
Then,
We have make pivot column 0 except pivot element
By using row- equivalent method
Since there is no presence of negative
number in last row (R3) so, the final table Applying R2 R2-R1 And R3 R3+7R1
give the optimal solution, i.e. We get
Basic coefficient
Maximum Z=21 AT (3,0) variable
x y s T Z CONSTANT
x 1 ¾ ¼ 0 0 3
T 0 5/4 -1/4 1 0 3
Z 0 1/4 7/4 0 1 21
 Principle OF Duality
Principle OF Duality
Introduced by John Von
Minimization ≤ Change of miximization problem to
Maximization ≥ minimization problem or vice-versa.

Primal - Dual Relationship

Primal (Min.) (≥) Dual (Max.) (≤)
≤ ≥ ≥ ≤

No. of Variables No. of Consaints

No. of Constraints No. of Variables
Objective function Coeff.icient R.H.S
R.H.S Objective function Coefficient
jth Column of Coefficient jth Row of Coefficient
ith Relation (≥) ith Variable ≥ 0
jth Variable ≥ 0 jth Relation (≤)
Application of
linear programing
problems in real
life
APPLICATION
S OF LINEAR
PROGRAMING
 Application in agricult

APPLICATION 1.For determination of

suitable temperature for
S OF LINEAR
crop production
PROGRAMING
2. For farm management
by using specified
production pattern.
 TRANSPORTATION AND
LOGISTIC
1.Allocate investment funds to
APPLICATION projects for optimal returns.
S OF LINEAR
PROGRAMING 2.To minimize the total
transportation cost.
 SCHEDULING AND
STAFFING
1.For selecting employee
in different post, wards,
etc.
APPLICATION
S OF LINEAR 2. For optimization of
resource allocation such
PROGRAMING as labor, machine and
materials.
 Application in industry

1.For optimization of profit

APPLICATION 2.For reducing the cost of
S OF LINEAR production
PROGRAMING
 War and Conflicts

1.For making optimum use of

available food, water and
APPLICATION ammunitions.
S OF LINEAR 2. For the purpose of
PROGRAMING selecting the best firearms
 PRODUCTION PLANING
A producer want to produce two types of whisky single malt and blended. Fort the production
company use three types of grains barely, ray, corn. Single malt whisky requires 0.5 barrels of
barley, 0.4 barrel of rye and 0.1 barrels of corn. Similarly blended whisky requires 0.3 barrels of
barley 0.4 barrels of Rey and 0.3 barrels of corn.
Available grains.
Barley 120 barrels @ $100
Rye 100 barrels @ $80
Corn 80 barrels @ $60
Objective function Z=100x+80y minimize the total cost.
Solutions
Let single malt whisky be X blended whisky be y
Then the inequalities be
0.5X+0.3Y<120
0.4X+0.4Y<100
0.1X+0.3Y<80
Then the corresponding equalities equations are
0.5X+0.3Y=120…………(i)
0.4X+0.4Y=100……………(ii)
0.1X+0.3Y=80……………..(iii)
production cannot be negative so x>0 and y>0
From the equation(i)
0.5X+O.3Y=120
IF X=0 then Y=400
IF Y=0 them X=240
Since the line passes through the point (0,400) and (240,0)

From the equation(ii)

0.4X+0.4Y=100
If X=0 then Y=250
If Y=0 then X=250
So the line passes through the point (0,250)and (250,0)

From the equation(iii)

0.1X+0.3Y=80
If X=0 then Y=267
If Y=0 then X=800
So the point passes through the point (0,267)and (800,0)
Taking origin as the testing point as the origin

From equation (i)

0.50+0.30<120
0+0<120
0<120 (true)

From equation (ii)

0.40+0.40<100
0+0<100
0<100(true)

From equation (iii)

0.10+0.30<80
0+0<80
0<80 (true)

Since all are true all line contain the origin

 Plotting the above information in the graph the we get, the
vertices of the feasible region

Vertices X Y Z=100X+80Y

(0,0) 0 0 0

(0,200) 0 200 16000

(160,100) 160 100 24000

(240,0) 240 0 24000

From the above calculation a producer can produce x=160 barrels

of single malt whisky and y=100 barrels of blended whisky from
the available grains at minimum cost of production
 RESOURCE
ALLOCATION
Suppose you run a factory that produces two products A and B. You have limited
resources and want to maximize your profit. Each product requires different amounts of
two resources (machine and labor hours) and each product earn different amount of
profit
Resources available Machine hours:100 hours
Labor hours:120 hours Resources requirements
Product A: 2 machine hours and 3 labor hours per unit
Product B: 4 machine hours and 2 labor hours per unit
Then objective function are Z=50X+40Y
Solution
Let product A and product B be x and y respectively
From the above information the inequalities are
2x+4y≤100
3x+2y≤120
The production cannot ne negative so x>0 and y>0
 The corresponding equality equation are
2x+4y=100……….(i)
3x+2y=120………..(ii)

From the equation (i)

If X=0 then Y=25
If Y=0 then x=50
So the line passes through the point (0,25) and (50,0)

Similarly, from the equation (ii)

If X=0 then Y=60
If Y=0 then X=40
So the line passes through the point (0,60) and (40,0)

Taking origin as a testing point in equation (i)

20+40≤100
0+0≤100
0≤100(true)
Taking origin as a testing point in equation (ii)
30+20≤120
0+0≤120
0≤120

Since the inequality is true in origin as a testing point both line contain the origin
Now plotting the above information in the graph we obtain
From the graph vertices are (0,0), (50,0), (0,25), (35,7.5)

vertices X Y Z=50x+40y

(0,0) 0 0 0
(50,0) 50 0 2500
(0,25) 0 25 1000
(35,7.5) 35 7.5 2050

The optimal allocation of resources is to produce

35 units of Product A and 7.5 units of Product B,
which maximizes the profit at $2050 while
respecting the resource constraints.
 Energy sector
A company have two sources of energy
Source 1:cost $50 per unit of electricity
Source 2:cost $80 per unit of electricity
Total energy demand is 500 unit
Source 1 can produce up to 300 units
Source 2 can produce up to 400 units objective function
be Z=50X​+80X​
Solution.
Let the decision variable be X and Y the units produced from energy sources 1 and
2 respectively
from the above given information the inequalities are
X​+Y​≥500
X​≤300 and Y​≤400
The energy sources cannot be negative so X≥0 and Y≥0
The corresponding equalities equation are
X​+Y​=500………..(i)
X​=300 ………….(ii)
Y​=400…………….(iii)

From the equation one

X​+Y​=500
If X=0 then Y=500
If Y=0 then X=500

Since the line passes through the point(0,500) and (500,0)

Taking origin as a testing point

0​+0>500
0>500(false)

So the feasible region does not contain origin

Source 1: x≤300
X​≤300 Vertical line at X=300
Source 2: Y≤400
Horizontal line at Y=400
 Graphical presentation
From the graph the vertices of feasible region
are (0,500), (300,200) and (100,400)
Vertices X Y Z=50X​+80X​

(0,500) 0 500 40000

(300,200) 300 200 31000

(100,400) 100 400 37000

The minimum cost is $31,000, achieved by

producing 300 units from Source 1 and 200
units from Source 2.
 conclusion
 Linear programing remains a vital tool across various industries for
optimization challenges
 As technology advances, integration with data analytics and
artificial intelligence will enhance its applications.
 The future of linear programing holds promise for solving even
more complex real-world problems efficiently.
 REFEReNCEs

https://www.cuemath.com

DR.PRAKASH M.BAJRACHARYA, BUDDHA

PUBLICATION GRADE XIi