Scribd
Upload
18 views

6-Standard form, Canonical Form, Basic Terminology-03-01-2025

The document discusses the solution of Linear Programming Problems (LPP) using the Simplex Method, defining key concepts such as feasible solutions, basic solutions, and optimal solutions. It explains the canonical and standard forms of LPP, along with examples illustrating the conversion of constraints and the identification of basic feasible solutions. The document emphasizes the importance of non-negativity restrictions and provides a framework for solving LPPs effectively.

Uploaded by

pavaneshwar04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

6-Standard form, Canonical Form, Basic Terminology-03-01-2025

The document discusses the solution of Linear Programming Problems (LPP) using the Simplex Method, defining key concepts such as feasible solutions, basic solutions, and optimal solutions. It explains the canonical and standard forms of LPP, along with examples illustrating the conversion of constraints and the identification of basic feasible solutions. The document emphasizes the importance of non-negativity restrictions and provides a framework for solving LPPs effectively.

Uploaded by

pavaneshwar04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Solution of LPP using Simplex Method

Let us consider the general LPP having 𝑛 variables and 𝑚 constraints (𝑚 ≤ 𝑛)


Convex set (region): A set S is said to be a convex set if for any given two points of
the set (region), the line joining of the points is entirely lies in set.

Solution: The values of the set of decision variables (𝑥1 , 𝑥2 , 𝑥3 , … 𝑥𝑛 ) which


satisfies all the constraints is called solution of the LP problem.

Feasible Solution: The solution of the LP problem which satisfies all the constraints
together with the non-negativity restrictions.
Basic Solution: The solution obtained by setting any 𝑛 (number of decision
variables given in the problem) number of variables (among 𝑚 + 𝑛 variables where,
m is the number of constraints) equals to zero and solving for remaining 𝑚 variables
is called basic solution. Provided the determinant of the coefficients of these 𝑚
variables is not zero. These 𝑚 variables are called basic variables and the
remining 𝑛 variables (which have been put zeros) are called non-basic variables.

𝑚+𝑛 !
Thus, the number of basic solutions obtained at most will be 𝑚 + 𝑛 𝑐𝑚 =
𝑚! 𝑛!
Basic feasible solution: The basic solution which also satisfies the non-negativity
restrictions is called Basic feasible solution.

Non-degenerate basic feasible solution: A basic feasible solution in which all the 𝑚
basic variables are positive (> 0) and the remaining 𝑛 variables are zeros is called
Non-degenerate basic feasible solution.

Degenerate basic feasible solution: A basic feasible solution in which one or more of
the 𝑚 basic variables are zeros is called degenerate basic feasible solution.
Optimal basic feasible solution: The basic feasible solution which optimizes the
objective function is called optimal basic feasible solution.

Unbounded solution: If the value of the objective function is not finite (i.e.,
indefinite) then the solution is said to be unbounded solution.
Example:
Discuss all the basic feasible solutions of the equations
2𝑥1 + 6𝑥2 + 2𝑥3 + 𝑥4 = 3,
6𝑥1 + 4𝑥2 + 4𝑥3 + 6𝑥4 = 2.

𝐀𝐧𝐬: Total variables are 4, and the number of constraints are 2.

Therefore, we will have 4𝑐2 = 6 total basic solutions. Let us discuss all of those basic solutions.

To write all those basic solutions, we have to make 4 − 2 = 2 variables to zeros. The possible cases are as follows.

1) By taking 𝑥1 = 0, 𝑥2 = 0 we get 𝑥3 = 2, 𝑥4 = −1 This is an Infeasible solution


2) By taking 𝑥1 = 0, 𝑥3 = 0 we get 𝑥2 = 0.5, 𝑥4 = 0 This is a feasible solution
3) By taking 𝑥1 = 0, 𝑥4 = 0 we get 𝑥2 = 0.5, 𝑥3 = 0 This is a feasible solution
4) By taking 𝑥2 = 0, 𝑥3 = 0 we get 𝑥1 = 8/3, 𝑥4 = −7/3 This is an Infeasible solution
5) By taking 𝑥2 = 0, 𝑥4 = 0 we get 𝑥1 = −2, 𝑥3 = 3.5 This is an Infeasible solution
6) By taking 𝑥3 = 0, 𝑥4 = 0 we get 𝑥1 = 0, 𝑥2 = 0.5 This is a feasible solution
Example:

Solution: Given solution is a basic solution. Moreover, it is feasible also.


Canonical Form:

The linear programming problem is said to be in canonical form if

(i) the objective function is of maximization type


(ii) All the constraints are of ≤ type (except the non-negativity restrictions which are of ≥
type)
(iii) All the decision variables are non-negative.

i.e.,
Standard Form:

The general linear programming problem is said to be in Standard form if

(i) objective function may be maximization or minimization form


(ii) the right-hand side of each constraint is non-negative
(iii) all constraints are of equality type
(iv) all decision variables are non-negative

i.e., • While converting the ≤ constraints to equality,


add a slack variable.
i.e., 𝑎 ≤ 𝑏 ⇒ 𝑎 + 𝑆1 = 𝑏 (in this case, 𝑆1
is called a slack variable).

• While converting the ≥ constraints to equality,


add surplus variable.
i.e., 𝑎 ≥ 𝑏 ⇒ 𝑎 − 𝑆1 = 𝑏 (in this case, 𝑆1
is called a surplus variable).
Example:

Solution:

Standard form of above system is given by:

𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑧 = 7𝑥1 + 5𝑥2 + 0 ⋅ 𝑆1 + 0 ⋅ 𝑆2 ,


𝑆𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 2𝑥1 + 3𝑥2 + 𝑆1 = 20,
3𝑥1 + 𝑥2 + 𝑆2 = 10,
𝑥1 , 𝑥2 , 𝑆1 , 𝑆2 ≥ 0.
Example:

Solution:

𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 3𝑥1 + 2𝑥2 + 5𝑥3 + 0 ⋅ 𝑆1 + 0 ⋅ 𝑆2 + 0 ⋅ 𝑆3


Subjected to 2𝑥1 − 3𝑥2 + 𝑆1 = 3,
𝑥1 + 2𝑥2 + 3𝑥3 − 𝑆2 = 5,
3𝑥1 + 2𝑥3 + 𝑆3 = 2,
𝑥1 , 𝑥2 , 𝑥3 , 𝑆1 , 𝑆2 , 𝑆3 ≥ 0.
Example:

Solution:

𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 3𝑥1 + 2𝑥2 + 5𝑥3 + 0 ⋅ 𝑆1 + 0 ⋅ 𝑆2 + 0 ⋅ 𝑆3


Subjected to 2𝑥1 + 3𝑥2 − 2𝑥3 + 𝑆1 = 40,
4𝑥1 − 2𝑥2 + 𝑥3 + 𝑆2 = 24,
𝑥1 − 5𝑥2 − 6𝑥3 − 𝑆3 = 2,
𝑥1 , 𝑥2 , 𝑥3 , 𝑆1 , 𝑆2 , 𝑆3 ≥ 0.

You might also like