STANDARD FORM
OF LPP
CHARACTERISTICS OF THE STANDARD FORM:
(i) The objective function is of maximization type
(ii) All constrains are expressed as equations
(iii) Right hand side of each constraint is non
negative
(iv) All variables are non negative
(i) Minimization of a function 𝑍 is equivalent
to Maximization of the negative expression
of this function
i.e. Min 𝑍 = −Max −𝑍
(ii) If RHS of any constraint is negative,
multiply that constraint by -1 to convert
the RHS to positive.
(iii) If a variable is unrestricted in sign, then it
can be expressed as difference of two
non-negative variable
i.e. 𝑋1 is unrestricted in sign, then
𝑋1 = 𝑋1′ − 𝑋1 ", where 𝑋1′ , 𝑋1 " are ≥ 0
(v) In standard form, all the constraints are
expressed in equation, which is possible by
introducing some additional variables
called slack variables and surplus variable
so that a system of simultaneously
linear equations is obtained.
Convert the following LPP in the standard form
EX 1. Maximize 𝑧 = 3𝑥1 + 5𝑥2
subject to 3𝑥1 + 2𝑥2 ≤ 15,
2𝑥1 + 5𝑥2 ≥ 12,
𝑥1 , 𝑥2 ≥ 0
Solution: Introducing the slack variables the
problem can be converted to standard
form as:
Maximize 𝑧 = 3𝑥1 + 5𝑥2 + 0𝑠1 + 0𝑠2
Subject to 3𝑥1 + 2𝑥2 + 𝑠1 + 0𝑠2 = 15,
2𝑥1 + 5𝑥2 + 0𝑠1 − 𝑠2 = 12,
𝑥1 , 𝑥2 , 𝑠1 , 𝑠2 ≥ 0
Convert the following LPP in the standard form
EX 2. Minimize 𝑧 = −3𝑥1 + 2𝑥2 − 𝑥3
Subject to 𝑥1 − 3𝑥2 + 2𝑥3 ≥ −6,
3𝑥1 + 4𝑥3 ≤ 3,
−3𝑥1 + 5𝑥2 ≤ 4,
𝑥1, 𝑥2 ≥ 0, 𝑥3 is unrestricted
Solution: Since the problem is of minimization
type we write 𝑧 ′ = −𝑧, so that the objective
function is of maximization type.
Since in the first constraints the right hand side is
negative, we multiply it by −1 , so
that it becomes positive and of less than type.
Hence, we add slack variable 𝑠1 ≥ 0 .
Since the second and the third constraints are
of less than type we add slack variables 𝑠2 and 𝑠3
both ≥ 0 .
Since 𝑥3 is unrestricted we write
𝑥3 = 𝑥3′ − 𝑥3 ′′ where 𝑥3′ ≥ 0, 𝑥3 " ≥ 0
Now the problem becomes
Maximize
𝑧 ′ = −𝑧 = 3𝑥1 − 2𝑥2 + 𝑥3′ − 𝑥3 + 0𝑠1 + 0𝑠2 + 0𝑠3
Subject to
−𝑥1 + 3𝑥2 − 2𝑥3 ′ + 2𝑥3 " + 𝑠1 + 0𝑠2 + 0𝑠3 = 6,
3𝑥1 + 0𝑥2 + 4𝑥3 ′ − 4𝑥3 " + 0𝑠1 + 𝑠2 + 0𝑠3 = 3,
−3𝑥1 + 5𝑥2 + 0𝑥′3 − 0𝑥3 " + 0𝑠1 + 0𝑠2 + s3 = 4,
𝑥1 , 𝑥2 , 𝑥3 ′, 𝑥3 ", 𝑠1 , 𝑠2 , 𝑠3 ≥ 0.
Convert the following LPP in the standard form
EX 3. Minimize 𝑧 = 2𝑥1 + 3𝑥2
Subject to 2𝑥1 − 3𝑥2 − 𝑥3 = −4,
3𝑥1 + 4𝑥2 − 𝑥4 = −6,
2𝑥1 + 5𝑥2 + 𝑥5 = 10,
4𝑥1 − 3𝑥2 + 𝑥6 = 18
𝑥3 , 𝑥4 , 𝑥5 , 𝑥6 ≥ 0
Solution:
Let 𝑥1 = 𝑦1 − 𝑦2 and 𝑥2 = 𝑦3 − 𝑦4 ,
𝑥3 = 𝑦5 , 𝑥4 = 𝑦6 , 𝑥5 = 𝑦7 , 𝑥6 = 𝑦8
The problem changes to
Maximize 𝑧 ′ = −𝑧 = −2𝑦1 + 2𝑦2 − 3𝑦3 + 3𝑦4
Subject to −2𝑦1 + 2𝑦2 + 3𝑦3 − 3𝑦4 + 𝑦5 = 4
−3𝑦1 + 3𝑦2 − 4𝑦3 + 4𝑦4 + 𝑦6 = 6
2𝑦1 − 2𝑦2 + 5𝑦3 − 5𝑦4 + 𝑦7 = 10
4𝑦1 − 4𝑦2 − 3𝑦3 + 3𝑦4 + 𝑦8 = 18
𝑦𝑖 ≥ 0 for all 𝑖 = 1, 2, … … . , 8
Covert the following LPP to standard form
EX 4. Maximize 𝑧 = 2𝑥1 + 3𝑥2 + 6𝑥3
Subject to 3𝑥1 − 2𝑥2 + 4𝑥3 ≤ 5,
2𝑥1 + 5𝑥2 = 10,
𝑥1 + 2𝑥2 + 𝑥3 ≤ 2,
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
Also put the problem in matrix form.
Solution: Introducing slack variables 𝑠1 and 𝑠3
both ≥ 0 , we have
Maximize 𝑧 = 2𝑥1 + 3𝑥2 + 6𝑥3 + 0𝑠1 + 0𝑠2
Subject to 3𝑥1 − 2𝑥2 + 4𝑥3 + 𝑠1 + 0𝑠2 = 5
2𝑥1 + 5𝑥2 + 0𝑥3 + 0𝑠1 + 0𝑠2 = 10
𝑥1 + 2𝑥2 + 𝑥3 + 0𝑠1 + 0𝑠2 = 2
Thus, the problem in the matrix form becomes:
Maximize 𝑧 = 𝐶𝑋
Subject to 𝐴𝑋 = 𝐵, 𝑋 ≥ 0
3 −2 4 1 0
Where, 𝐴 = 2 5 0 0 0 ,
1 2 1 0 −1
𝑥1
𝑥2 5
𝑋 = 𝑥3 , 𝐵 = 10 , 𝐶 = 2 3 6 0 0
𝑠1 2
𝑠2
