Scribd
Upload
12 views

LPP Notes

Uploaded by

prateek.routray30
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

LPP Notes

Uploaded by

prateek.routray30
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

LINEAR PROGRAMMING PROBLEM

Linear programming is the process of taking various linear inequalities relating to some situation and
finding the "best" value obtainable under those conditions.
 Objective function: The function to be maximized or minimized is called an objective function.
 Constraints: The linear inequalities or restrictions on the variables of a linear programming
problem.
 Optimisation problem: A problem, which seeks to maximize or minimize a linear function
subject to certain constraints.
 The common region determined by all the constraints including the non-negative constraints
x ≥ 0, y ≥ 0 of a linear programming problem is called the feasible region. (or solution region)
for the problem.
 Points within and on the boundary of the feasible region represent feasible solutions of the
constraints.
 Any point outside the feasible region is an infeasible solution.
 Any point in the feasible region that gives the optimal value (maximum or minimum) of the
objective function is called an optimal solution.
THEOREM1: Let R be the feasible region for the LPP and let 𝑍 = 𝑎𝑥 + 𝑏𝑦 be the objective function. If
Z has an optimal value, then it must occur at a corner point of the feasible region.
THEOREM2: If R is bounded then the objective function Z has both a maximum and minimum value
on R and each occurs at the corner point.
STEPS INVOLVED IN SOLVING A LPP
1. Draw the graph of all the constraint inequalities
2. Shade the feasible region.
3. Mark the corner points
If feasible region is BOUNDED
4. Substitute corner points in Z and tabulate the values in decision table
5. Write the conclusion.

If feasible region is UNBOUNDED then


(i) M is the maximum value of the objective function, if the open half plane determined by
ax + by > M has no point in common with the feasible region. Otherwise, the objective
function has no maximum value.
(ii) m is the minimum value of the objective function, if the open half plane determined by
ax + by < m has no point in common with the feasible region. Otherwise, the objective
function has no minimum value.
1. Maximise 𝑍 = 5𝑥 + 3𝑦 2. Minimise 𝑍 = 6𝑥 + 3𝑦
Subject to 3𝑥 + 5𝑦 ≤ 15 Subject to 4𝑥 + 𝑦 ≥ 80
5𝑥 + 2𝑦 ≤ 10 𝑥 + 5𝑦 ≥ 115
𝑥 ≥ 0, 𝑦 ≥ 0 3𝑥 + 2𝑦 ≤ 150
𝑥 ≥ 0, 𝑦 ≥ 0

Ans : Zmax=235/19 at (20/19,45/19) Ans : Zmin=150 at (15,20)

3. Minimise and Maximise 𝑍 = 5𝑥 + 10𝑦 4. Minimise and maximise 𝑍 = 𝑥 + 2𝑦


Subject to 𝑥 + 2𝑦 ≤ 120 Subject to 𝑥 + 2𝑦 ≥ 100
𝑥 + 𝑦 ≥ 60 2𝑥 − 𝑦 ≤ 0
𝑥 − 2𝑦 ≥ 0 2𝑥 + 𝑦 ≤ 200
𝑥 ≥ 0, 𝑦 ≥ 0 𝑥 ≥ 0, 𝑦 ≥ 0

Ans: Zmin=300 at (60,0) Ans: Zmax=400 at (0,200)


Zmax=600 at (60,30) ans (120,0) and at all Zmin=100 at (0,50) and (20,40) and at all
points on the line segment joining these two points on the line segment joining these two
points. points.
5. Minimise 𝑍 = 3𝑥 + 5𝑦 6. Maximise 𝑍 = −𝑥 + 2𝑦
Subject to 𝑥 + 3𝑦 ≥ 3 Subject to 𝑥 ≥ 3
𝑥+𝑦 ≥2 𝑥+𝑦 ≥5
𝑥 ≥ 0, 𝑦 ≥ 0 𝑥 + 2𝑦 ≥ 6
𝑦≥0
Ans : Zmin=7 at (3/2,1/2) Ans : Z has no maximum value

7. Maxmise 𝑍 = 1000𝑥 + 600𝑦 8. Minimise 𝑍 = −50𝑥 + 20𝑦


Subject to 𝑥 + 𝑦 ≤ 200 Subject to 2𝑥 − 𝑦 ≥ −5
𝑥 ≥ 20 3𝑥 + 𝑦 ≥ 3
𝑦 − 4𝑥 ≥ 0 2𝑥 − 3𝑦 ≤ 12
𝑥 ≥ 0, 𝑦 ≥ 0 𝑥 ≥ 0, 𝑦 ≥ 0

Ans : Zmax=1,36,000 at (40,160) Ans : Z has no minimum value


9. Minimise 𝑍 = 10𝑥 + 4𝑦 10. Maximise 𝑍 = 3𝑥 + 9𝑦
Subject to 4𝑥 + 𝑦 ≥ 80 Subject to 𝑥 + 3𝑦 ≤ 60
2𝑥 + 𝑦 ≥ 60 𝑥 + 𝑦 ≥ 10
𝑥 ≥ 0, 𝑦 ≥ 0 𝑥≤𝑦
𝑥 ≥ 0, 𝑦 ≥ 0
Ans : Zmin=260 at (10,40)
Ans : Zmin=60, Zmax=180 at (15,15) and (0,20) and
at all points on the line segment joining these
two points.

You might also like