LINEAR PROGRAMMING PROBLEM (LPP)

GRAPHICAL METHOD

The graphical method of solving a LPP is applicable where two

variables are involved. The most widely used method for solving LPP
consisting of any number of variables is called simplex method
developed by G. Dantzig in 1947 & made generally available in 1951.

Formulation of LPP :

 Decision variables

 Objective functions

 Constraints
LINEAR PROGRAMMING
Linear programming deals with the optimization (maximization or minimization)of a
function of variables known as objective functions. It is subject to a set of linear equalities
and/or inequalities known as constraints. Linear programning is a mathematical technique
which implies the allocation of limited resources in an optimal manner, on the basis of a
given criterion of optimality. The graphical method of solving a LPP is applicable where two
variables are involved.

FORMULATION OF UF PROBLEMS
 Step 1 To write down the decision variables of the problems.
 Step 2 To formulate the objective function to be optimized (maximized or minimized) as
a linear function of the decision variables.
 Step 3 To formulate the other conditions of the problem such as resource station,
market. The general formulation of the LPP can be stated as follows: the constraints,
interrelations between variables etc., as near equations or equations decision variables.
 Step 4 To add the non-negativity constraint from the considerations so that the negative
values of the decision variables go not have any valid physical interpretation.
 LINEAR PROGRAMMING PROBLEM (LPP)
GRAPHICAL METHOD

Maximize Z Max = 12 X1 + 16 X2

Subject to 10 X1 + 20 X2 ≤ 120
8 X1 + 8 X2 ≤ 80

X1 & X2 ≥ 0
Solution: 10 X1 + 20 X2 = 120 --------------- 1

When X1 = 0
10 (0) + 20 X2 = 120
20 X2 = 120
X2 = 120/ 20
X2 = 6
When X2 = 0
10 X1 + 20 (0) = 120
10 X1 = 120
X1 = 120/ 10
X1 = 12

[ X1 = 12 & X2 = 6 ]
16
15
14
13
12
11
10
9
8
7
6
5
4
3
2
1

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
Solution: 8 X1 + 8 X2 = 80 ------------ 2

When X1 = 0
8 (0) + 8 X2 = 80
8 X2 = 80
8 X2 = 80/ 8
X2 = 10
When X2 = 0
8 X1 + 8 (0) = 80
10 X1 = 80
X1 = 80/ 8
X1 = 10

[ X1 = 10 & X2 = 10 ]
16
15
14
13
12
11
10
9
8
7
6
5
4
3
2
1

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
16
15
14
13
12
11
2nd Constraint
10
9
8
7
6
5
4
3 1st Constraint
2
1

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
 Z Max = 12 X1 + 16 X2

Z (A) = 12 (0) + 16 (0) = 0

Z (B) = 12 (10) + 16 (0) = 120

Z (C) = 12 (8) + 16 (2) = 96 + 32 =128

Z (D) = 12 (0) + 16 (6) = 96

 Z Max = 12 X1 + 16 X2

Z (A) = 12 (0) + 16 (0) = 0

Z (B) = 12 (10) + 16 (0) = 120

Z (C) = 12 (8) + 16 (2) = 96 + 32 =128

Z (D) = 12 (0) + 16 (6) = 96

The z value is maximum at corner point c

X1 =8 X2 =2 z (optimum) = 128