Formulation of Linear Programming Model:

Step-1:
From the study of the situation find the key decision to be made. In this connection, looking for
variables helps considerably. In the given situation key decision is to decide the number of units of
products 1 and 2 to be produced daily.
Step-2:
Assume symbols for variable quantities noticed in step-1.Let the number of units of
products,1,and 2 manufactured daily be x1 and x2.
Step-3:
Express the feasible alternatives mathematically in terms of variables. Feasible alternatives are those
which are physically, economically, and financially possible. In the given situation feasible alternatives
are sets of values of x1 and x2.
where x1, x2 ≥ 0.
since negative production has no meaning and is not feasible.
Step-4:
Mention the objective quantitatively and express it as a linear function of variables. In the present
situation, objective is to maximize and profit.
i.e., maximize Z = 50x1+ 60x2
Step-5:
Put into words the influencing factors or constraints. These occur generally because of constraints on
availability(resources) or requirements(demands).Express these constraints also as linear
equations/inequalities in terms of variables.
Here, constraints are on the machine capacities and can be mathematically expressed as
2x1 + 1x2 ≤ 300
3x1 + 4x2 ≤ 509
4x1 + 7x2 ≤ 812
∴, the complete mathematical(L.P) model for the problem can be written as
Maximize Z=50x1+60x2
subject to constraints, 2x1 + 1x2 ≤ 300
                                   3x1 + 4x2 ≤ 509
                                   4x1 + 7x2 ≤ 812

Step 1 – First Constrain

Introduce slack variables wherever needed:

2X1 + X3 < 12

2X1 + X3 + X4 = 12

Here X4 is the slack variable

Step 2 – Second Constrain

2X1 – X2 + 2X3 > 05

2X1 – X2 + 2X3 - X5 = 05

Here X5 is the Surplus variable

Step 3 – Non negative Constrain

X1, X2, X3, X4, X5 > 0

X1, X2, X3 are given variables

X4 is slack variable

X5 is surplus variable

Step 4 – Objective function

Max Z = 3X1 + 4X2 – 3X3 + 0X4 - 0X5

X1, X2, X3 are given variables

X4 is slack variable

X5 is surplus variable

Step 4 – Modified Standard

2X1 + X3 < 12

2X1 + X3 + X4 = 12

2X1 – X2 + 2X3 > 05

2X1 – X2 + 2X3 - X5 + X6= 05

X1, X2, X3 are given variables

X4 is slack variable

X5 is surplus variable

X6 is Artificial variable

Step 4 – Objective form

Max Z = 3X1 + 4X2 – 3X3 + 0X4 - 0X5 -MX6

2X1 + X3 + X4 = 12

2X1 – X2 + 2X3 - X5 + X6= 05

Here X1, X2, X3 are given variables

X4 is slack variable
X5 is surplus variable

X6 is Artificial variable

M>0

For equation 4X1 + 5X2 < 1000

Let X= 0 i.e Y =200

Let Y= 0 i.e X =250

For equation 5X1 + 2X2 < 1000

Let X= 0 i.e Y =500

Let Y= 0 i.e X =200

For equation 5X1 + 2X2 < 1200

Let X= 0 i.e Y =600

Let Y= 0 i.e X =240

We get two coordinates for each line

(0,200) , (250,0)

(0,500) , (200,0)
(0,600) , (240,0)

The Graph is Depicted below

E = 0,0

0,200

170,70

200,0

C =5

3
EC = 0*5 + 0*3

0*5 + 200*3

170*5 + 70*3

200*5 + 0*3

E C= 0

600

1060

1000

Since largest element in matrix EC there for the maximum value is reached at the extreme point E3
whose coordinates are (170,70),

so the optimal solution Max Z = 170*5 + 70*3 = 1060

Step 1 : Canonical Form

1) Objective function is maximization

2) All the three constrains are of ≤ type and right hand no’s are Non negative
3) Variables X1, X2 are non negative

Step 2 : Standard Form

2X1 + X2 ≤ 50

2X1 + X2 + X3 = 50
Here X3 is slack variable

Step 3 : Second Constrain

2X1 + 5X2 ≤ 100

2X1 + 5X2 + X4 = 100

Here X4 is slack variable

Step 4 : Third Constrain

2X1 + 3X2 ≤ 90

2X1 + 3X2 + X5 = 90

Here X5 is slack variable

Step 4 : Non Negative Constraints

Here X1, X2, X3, X4, X5 ≥ 0

X1, X2 are given variables

X3, X4, X5 are slack variables

Step 5: Objective Function

Max Z = 4X1 + 10X2 + 0X3 + 0X4 + 0X5

X1, X2 are given variables

X3, X4, X5 are slack variables

Summary

Max Z = 4X1 + 10X2 + 0X3 + 0X4 + 0X5

2X1 + X2 + X3 = 50

2X1 + 5X2 + X4 = 100

2X1 + 3X2 + X5 = 90

Here X1, X2, X3, X4, X5 ≥ 0

X1, X2 are given variables

X3, X4, X5 are slack variables

Step 1 : Canonical Form

1) Objective function is maximization

2) Right hand no’s are Non negative
3) Variables X1, X2 are non negative
Step 2 : Standard Form - First Constrain

X1 + X2 ≥ 05

X1 + X2 - X3 = 05

Here X3 is surplus variable

Step 3 : Second Constrain

X1 + 2X2 ≥ 06

X1 + 2X2 - X4 = 06

Here X4 is Surplus variable

Step 4 : Non Negative Constraints

Here X1, X2, X3, X4 ≥ 0

X1, X2 are given variables

X3, X4 are a slack variable

Step 5: Objective Function

Max Z = 2X1 + 3X2 + 0X3 + 0X4

X1 + X2 + X3 = 05

X1 + 2X2 - X4 = 06

Here X1, X2 are given variables

X3, X4 is surplus variables

Step 6: Modified Standard Form

X1 + X2 ≥ 05

X1 + X2 - X3 + X5= 05

X1 + 2X2 ≥ 06

X1 + 2X2 - X4 + X6= 06

Here X1, X2 are given variables

X3, X4 is surplus variables

X5, X6 is Artificial variables

Step 7: Objective Function

Max Z = 2X1 + 3X2 + 0X3 + 0X4 – MX5 – MX6

X1 + X2 - X3 + X5= 05

X1 + 2X2 - X4 + X6= 06

Here X1, X2 are given variables

X3, X4 is surplus variables

X5, X6 is Artificial variables

X1, X2, X3 , X4 , X5 , X6≥ 0

M>0

Step 1 : Canonical Form

1) Objective function is maximization

2) All the three constrains are of ≤ type and right hand no’s are Non negative
3) Variables X1, X2, X3, X4 are non negative

Step 2 : Standard Form

2X1 + X2 + 5X3 + 6X4 ≤ 20

2X1 + X2 + 5X3 + 6X4 + X5= 20

Here X5 is slack variable

Step 3 : Second Constrain

3X1 + X2 + 3X3 + 25X4 ≤ 24

3X1 + X2 + 3X3 + 25X4 +X6= 24

Here X6 is slack variable

Step 4 : Third Constrain

7X1 + X4 ≤ 70

7X1 + X4 + X7 = 70

Here X7 is slack variable

Step 4 : Non Negative Constraints

Here X1, X2, X3, X4, X5 , X6, X7 ≥ 0

X1, X2, X3, X4 are given variables

X5, X6, X7 are slack variables

Step 5: Objective Function

Max Z = 15X1 + 6X2 + 9X3 + 2X4 + 0X5 + 0X6 + 0X7

X1, X2, X3, X4 are given variables

X5, X6, X7 are slack variables

Summary

Max Z = 15X1 + 6X2 + 9X3 + 2X4 + 0X5 + 0X6 + 0X7

2X1 + X2 + 5X3 + 6X4 + X5= 20

3X1 + X2 + 3X3 + 25X4 +X6= 24

7X1 + X2 + X7 = 70

Here X1, X2, X3, X4, X5, X6, X7 ≥ 0

X1, X2, X3, X4 are given variables

X5, X6, X7 are slack variables

cj 15 6 9 2 0 0 0
CB XB Solutio X1 X2 X3 X4 X5 X6 X7 TR
n
0 X5 20 2 1 5 6 1 0 0 20/2
 0 X6 24 3 1 3 25 0 1 0 24/3
0 X7 70 7 0 0 1 0 0 1 70/7
  Z=0 -15 -6 -9 -2 0 0 0  

CB XB Solutio X1 X2 X3 X4 X5 X6 X7 TR
n
0 X5 4 0 1/3 3 -32/3 1 -2/3 0  
15 X1 8 1 1/3 3/3 25/3 0 1/3 0  
0 X7 14 0 -7/3 -7 -172/3 0 -7/3 1  
  120 0 -1 6 123 0 5 0  

(Z2−C2)=−1<0 , the current basic feasible solution is not optimal.

cj 15 6 9 2 0 0 0
CB XB Solutio X1 X2 X3 X4 X5 X6 X7 TR
n
6 X2 12 0 1 9 -32 3 -2 0  
15 X1 4 1 0 -2 57/3 -1 1 0  
0 X7 42 0 0 14 -132 7 -7 1  
  132 0 0 15 91 3 3 0  

Thus the optimum solution obtained

Max Z = 132
X1=4, X2=12, X3=0, X4=0

07 a) A factory manufactures two products A and B. To manufacture one unit of A, 1.5 machine hours
and 2.5 labour hours are required. To manufacture product B, 2.5 machine hours and 1.5 labour hours
are required. In a month, 300 machine hours and 240 labour hours are available. Profit per unit for A is
Rs. 50 and for B is Rs. 40. Formulate as LPP solve the same using graphical method.

Solution:
Products Resource/unit
Machine Labour
A 1.5 2.5
 B 2.5 1.5
Availability 300 hrs 240 hrs
There will be two constraints. One for machine hours availability and for labour hours availability.
Decision variables
X1 = Number of units of A manufactured per month.
X2 = Number of units of B manufactured per month.
The objective function:
Max Z = 50x1+ 40x2
Subjective Constraints
For machine hours
1.5x1+ 2.5x2 ≤ 300
For labour hours
2.5x1+ 1.5x2 ≤ 240
Non negativity
x1, x2 ≥0

07 b) A farmer has 200 acres of land. He produces three products X, Y & Z. Average yield per acre for
X, Y & Z is 4000, 6000 and 2000 kg. Selling price of X, Y & Z is Rs. 2, 1.5 & 4 per kg respectively. Each
product needs fertilizers. Cost of fertilizer is Rs. 1 per kg. Per acre need for fertilizer for X, Y & Z is 200,
200 & 100 kg respectively. Labour requirements for X, Y & Z is 10-, 12- & 10-man hours per acre. Cost
of labour is Rs. 40 per man hour. Maximum availability of labour is 20, 000-man hours. Formulate as
LPP to maximise profit hence solve it.

Solution:

Decision variables:
The production/yield of three products P1, P2& P3 is given as per acre.
Hence,
X1 = No. of acres allocated to P1
X2 = No. of acres allocated to P2
X3 = No. of acres allocated to P3

Objective Function:
Profit = Revenue - Cost
Profit = Revenue - (Fertilizer Cost + Labour Cost)
 Product P1 P2 P3
Revenue 2 * (4000) * X1 1.5 * (6000) * X2 4 * (2000) * X3

(-) Less
Fertilizer Cost 1* (200) * X1 1 * (200) * X2 1 * (100) * X3
Labor Cost 40* (10) * X1 40 * (12) * X2 40 * (10) * X3
Profit 7400 X1 8320 X2 7500 X3

⸫ Objective function Max. = 7400 X1 + 8320 X2 + 7500 X3

Subject to constraints:
X1 + X2 + X3 = 200 (Total Land)
10 X1 + 12 X2 + 10 X3 ≤ 20, 000 (Max Man hours)
X1, X2, X3 ≥ 0

Step 1 – First Constrain

Introduce slack variables wherever needed:

X1 - 2X2 ≥ -4

-X1 + 2X2 ≤ 4

-X1 + 2X2 + X3 = 4

Here X3 is the Slack variable

Step 2 – Second Constrain

2X1 + 44X2 > 12

2X1 +44 X2 -X4 = 12

Here X4 is the Surplus variable

Step 3 – Second Constrain

X1 + 3X2 > 9

X1 +3 X2 -X5 = 9

Here X5 is the Surplus variable

Step 4 – Non negative Constrain

X1, X2, X3, X4, X5, X6 > 0

X1, X2 are given variables

X3 is slack variable

X4, X5 are surplus variable

Step 5 – Objective function

Max Z = 4X1 + 6X2 + 0X3 + 0X4 +0X5

X1, X2 are given variables

X3 is slack variable

X4, X5 are surplus variable

Step 5 – Modified Standard form

-X1 + 2X2 ≤ 4

-X1 + 2X2 + X3 = 4

2X1 +44 X2 -X4 = 12

2X1 +44 X2 -X4 + X6 = 12

 X1 +3 X2 -X5 = 9

X1 +3 X2 -X5 + X7= 9

X1, X2 are given variables

X3 is slack variable

X4, X5 are surplus variable

X6, X7 are artificial variable

Objective Form

Max Z = 4X1 + 6X2 + 0X3 + 0X4 +0X5 -MX6 – MX7

-X1 + 2X2 + X3 = 4

2X1 +44 X2 -X4 + X6 = 12

X1 +3 X2 -X5 + X7= 9

X1, X2, X3, X4, X5, X6, X7 > 0

X1, X2 are given variables

X3 is slack variable

X4, X5 are surplus variable

X6, X7 are artificial variable

M>0

Initial Table

cj 4 6 0 0 0 -M -M
CB XB Solution X1 X2 X3 X4 X5 X6 X7 TR
0 X3 4 -1 2 1 0 0 0 0 4/2
-M X6 12 2 44 0 -1 0 1 0 12/44
-M X7 9 1 3 0 0 -1 0 1 9/3
  Z=-21M -3M-4 -47M-6 0 M M 0 0  

cj 4 6 0 0 -M 0 -M
CB XB Solution X1 X2 X3 X4 X5 X6 X7 TR
0 X3 152/44 -46/44 0 1 2/44 0 -2/44 0  
6 X5 12/44 2/44 1 0 -1/44 0 1/44 0  
-M X2 396/44 38/44 0 0 3/44 -1 -3/44 1  

Step 1 : Canonical Form

1) Objective function is maximization

2) Right hand no’s are Non negative
3) Variables X1, X2, X3, X4, are non negative

Step 2 : Standard Form - First Constrain

X1 +2X2 +3X3 = 15

X1 +2X2 +3X3 = 15

Step 3 : Second Constrain

2X1 + X2 +5X3 ≥ 20

2X1 + X2 +5X3 – X5 = 20

Here X5 is Surplus variable

Step 4 : Second Constrain

X1 + 2X2 +X3 +X4 ≥ 10

X1 + 2X2 +X3 +X4 – X6 = 10

Here X6 is Surplus variable

Step 4 : Non Negative Constraints

Here X1, X2, X3, X4, X5, X6 ≥ 0

X1, X2, X3, X4 are given variables

X5, X6 is surplus variables

Step 5: Objective Function

Max Z = X1 + 2X2 + 3X3 – X4 + 0X5 + 0X6

Here X1, X2, X3, X4, X5, X6 ≥ 0

X1, X2, X3, X4 are given variables

X5, X6 is surplus variables

Step 6: Modified Standard

X1 +2X2 +3X3 = 15

X1 +2X2 +3X3 + X7= 15

2X1 + X2 +5X3 ≥ 20

2X1 + X2 +5X3 – X5 + X8= 20

X1 + 2X2 +X3 +X4 ≥ 10

X1 + 2X2 +X3 +X4 – X6 + X9= 10

X1, X2, X3, X4 are given variables

X5, X6 is surplus variables

X7, X8, X9 is Artificial variable

Step 6: Objective Function

Max Z = X1 + 2X2 + 3X3 – X4 + 0X5 + 0X6 - MX7 – MX8 – MX9

Here X1, X2, X3, X4, X5, X6, X7, X8, X9 ≥ 0

X1, X2, X3, X4 are given variables

X5, X6 is surplus variables

X7, X8, X9 is Artificial variable

Summary

Max Z = X1 + 2X2 + 3X3 – X4 + 0X5 + 0X6 - MX7 – MX8 – MX9

X1 +2X2 +3X3 + X7= 15

2X1 + X2 +5X3 – X5 + X8= 20

X1 + 2X2 +X3 +X4 – X6 + X9= 10

Here X1, X2, X3, X4, X5, X6, X7, X8, X9 ≥ 0

X1, X2, X3, X4 are given variables

X5, X6 is surplus variables

X7, X8, X9 is Artificial variable

M>0

Initial Table

cj 1 2 3 -1 0 0 -M -M -M
Solutio
CB XB X1 X2 X3 X4 X5 X6 X7 X8 X9 TR
n
-M X7 15 1 2 3 0 0 0 1 0 0 15/3
-M X8 20 2 1 5 0 -1 0 0 1 0 20/5
-M X9 10 1 2 1 1 0 -1 0 0 1 10/1
-
-9M-
  Z = - 45M -4M-1 -5M-2 1M+ 1M 1M 0 0 0  
3
1

cj 1 2 3 -1 0 0 -M -M -M
Solutio
CB XB X1 X2 X3 X4 X5 X6 X7 X8 X9 TR
n
(-M) X7 3 -1/5 7/5 0 0 3/5 0 1 -3/5 0  
3 X3 4 2/5 1/5 1 0 0 -1/5 1/5 0 0  
(-M) X9 6 3/5 9/5 0 1 0 -4/5 -1/5 0 1  
-2M/5 -16M/5 - 4M/5 4M/5
Z = -9M+12 3 -M 3M/5 -M/5  
+ 6/5 + 3/5 3M/5 - 3/5 + 3/5

CB XB Solutio X1 X2 X3 X4 X5 X6 X7 X8 X9 TR
n
2 X2 2.14 -0.14 1 0 0 0.43 0 -0.43 0 0.71  
3 X3 3.57 0.43 0 1 0 -0.29 0 0.29 0 -0.14  
(-M) X8 2.14 0.86 0 0 1 -0.57 -1 0.57 1 -1.29  
Z = -2.14M+15 - 0 0 - 0.57 M 0.43 0 2.29M+  
0.86 M+1 M M 1
M
CB XB Solu X1 X2 X3 X4 X5 X6 X7 X8 X9 TR
tion
2 X2 2.5 0 1 0 0.17 o.73 -0.17 -0.33 0.17 0.5  
3 X3 2.5 0 0 1 -0.5 0 0.5 0 -0.5 0.5  
1 X1 2.5 1 0 0 1.17 -0.67 -1.17 0.67 -1.17 -1.5  
Z = 15 0 0 0 1 0 0 M M M+1