 Linear programming deals with optimization

(maximization or minimization) of a function

of variables known as objective functions.
 It is subjected to a set of linear equalities
and /or inequalities known as constraints.
 Linear programming is a mathematical
technique which involves the allocation of
limited resources in an optimal manner, the
basis of a given criterion of optimally.

Nandini Rai KJSCE LPP 3/30/2024 2

The procedure for mathematical formulation of
a LPP consist of the following steps
Step 1: To write down the decision variables
of the problem
Step 2: To formulate the objective function
to be optimized (maximized or
minimized) as a linear function of the
decision variables

Nandini Rai KJSCE LPP 3/30/2024 3

Step 3: To formulate the other conditions of
the problem such as resource
limitation, market constraints,
interrelation between variable etc, as
linear inequations or equations in
terms of the decision variables

Nandini Rai KJSCE LPP 3/30/2024 4

Step 4: To add the non-negativity constraint
from the considerations so that the
negative values of the decision
variables do not have any valid
physical interpretation

The objective functions, the set of constraints

and non-negative constraints form a Linear
Programming Problem

Nandini Rai KJSCE LPP 3/30/2024 5

The general LP problem with ′𝑛′ decision variables and ′𝑚′
constraints
can be stated in the following form
Find the values of decision variables 𝑥1 , 𝑥2 , … … , 𝑥𝑛 so as to
Optimize (max or min) 𝑍 = 𝐶1 𝑥1 + 𝐶2 𝑥2 + ⋯ + 𝐶𝑛 𝑥𝑛
(Objective function)
subject to the linear constraints
𝑎11 𝑥1 + 𝑎12 𝑥2 + … … + 𝑎1𝑛 𝑥𝑛 ≤, =, ≥ 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + … … + 𝑎2𝑛 𝑥𝑛 ≤, =, ≥ 𝑏2 (constraints)
………………………………………………………………
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + … … + 𝑎𝑚𝑚 𝑥𝑛 ≤, =, ≥ 𝑏𝑚
And 𝑥1 , 𝑥2 , … … , 𝑥𝑛 ≥ 0 (non-negativity constraints)

Nandini Rai KJSCE LPP 3/30/2024 6

EX. A dealer sells two articles 𝐴 and 𝐵. He
earns Rs 2 and 3 when he sells one piece
of 𝐴 and 𝐵 respectively. He buys these
articles at the rate of Rs 1 and Rs 2
respectively in the morning and sells them
out in the evening. He invests only 100 Rs.
Write down the equations of his profit and
other conditions

Nandini Rai KJSCE LPP 3/30/2024 7

ANS:
Maximize 𝑧 = 2𝑥1 + 3𝑥2
Subject to 𝑥1 + 2𝑥2 ≤ 100
and 𝑥1 ≥ 0, 𝑥2 ≥ 0

Nandini Rai KJSCE LPP 3/30/2024 8

EX 1. Solve the following LPP by graphical
method
Minimize 𝑍 = 20𝑥1 + 10𝑥2
Subject to 𝑥1 + 2𝑥2 ≤ 40,
3𝑥1 + 𝑥2 ≥ 30,
4𝑥1 + 3𝑥2 ≥ 60,
𝑥1 , 𝑥2 ≥ 0

Nandini Rai KJSCE LPP 3/30/2024 9

Nandini Rai KJSCE LPP 3/30/2024 10
Corners Points Value of 𝑍 = 20𝑥1 + 10𝑥2
𝐴 15, 0 300
𝐵 40, 0 800
𝐶 4, 18 260
𝐷 6, 12 240 (Minimum value)

∴ The minimum value of 𝑍 occurs at

𝐷 6, 12
Hence the optimal solution is
𝑥1 = 6, 𝑥2 = 12

Nandini Rai KJSCE LPP 3/30/2024 11

The general LP problem with ′𝑛′ decision variables and ′𝑚′
constraints
can be stated in the following form
Find the values of decision variables 𝑥1 , 𝑥2 , … … , 𝑥𝑛 so as to
Optimize (max or min) 𝑍 = 𝐶1 𝑥1 + 𝐶2 𝑥2 + ⋯ + 𝐶𝑛 𝑥𝑛
(Objective function)
subject to the linear constraints
𝑎11 𝑥1 + 𝑎12 𝑥2 + … … + 𝑎1𝑛 𝑥𝑛 ≤, =, ≥ 𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + … … + 𝑎2𝑛 𝑥𝑛 ≤, =, ≥ 𝑏2 (constraints)
………………………………………………………………
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + … … + 𝑎𝑚𝑚 𝑥𝑛 ≤, =, ≥ 𝑏𝑚
And 𝑥1 , 𝑥2 , … … , 𝑥𝑛 ≥ 0 (non-negativity constraints)

Nandini Rai KJSCE LPP 3/30/2024 12

The linear programming problem can be expressed in the
matrix form
as follows.
Maximize or Minimize 𝑍 = 𝐶𝑋
≤
Subject to 𝐴𝑋 = 𝑏, 𝑋 ≥ 0
≥
Where𝑥
1 𝑏1
𝑋 = …𝑥2… , 𝑏 = …𝑏2… , 𝐶 = 𝐶1 𝐶2 … … 𝐶𝑛 1×𝑛
𝑥𝑛 𝑛×1 𝑏𝑚
𝑎11 𝑎12 …𝑚×1 . . 𝑎1𝑛
and 𝐴 = …𝑎21 𝑎22 … . . 𝑎2𝑛
…. …… …… ……
𝑎𝑚𝑙 𝑎𝑚2 … . . 𝑎𝑚𝑛 𝑚×𝑛

Nandini Rai KJSCE LPP 3/30/2024 13

1. Solution: Solution values of decision
variables 𝑥𝑗 𝑗 = 1, 2, … … , 𝑛 which satisfy the
constraints of a general LP model is called a
solution to that LP model.

Nandini Rai KJSCE LPP 3/30/2024 14

2. Feasible Solution: Solution values of decision
variables 𝑥𝑗 𝑗 = 1, 2, … … , 𝑛 which satisfy
the constraints and non negativity condition of a
general LP model are said to constitute the
feasible solution to that LP model

Nandini Rai KJSCE LPP 3/30/2024 15

3. Basic Solution: For a set of 𝒎 equations in 𝒏
variable 𝒏 > 𝑚 , a solution obtained by setting
𝑛 − 𝑚 variables equal to zero and solving for
remaining 𝑚 equations in 𝑚 variables is called a
basic solution.

Nandini Rai KJSCE LPP 3/30/2024 16

 Number of basic solution is 𝑛𝐶𝑚 = 𝑛𝐶𝑛−𝑚
 The 𝑛 − 𝑚 variables whose values did not
appear in this solution are called non-basic
variables and the
 Remaining 𝑚 variables are called basic variables

Nandini Rai KJSCE LPP 3/30/2024 17

4. Basic Feasible Solution: A feasible solution to
an LP problem which is also the basic solution is
called the basic feasible solution. i.e. All basic
variables assume non-negative values

Nandini Rai KJSCE LPP 3/30/2024 18

Basic Feasible Solutions are of two types
(1) Degenerate basic feasible solution: A basic
feasible solution is called degenerate if at least
one basic variable possesses zero value
(2) Non degenerate basic feasible solution: A
basic feasible solution is called non degenerate if
all 𝑚 basic variables are non zero and positive

Nandini Rai KJSCE LPP 3/30/2024 19

5. Optimum basic feasible solution: A basic
feasible solution which optimizes (maximizes
or minimizes) the objective function of the
given LP model is called on optimum basic
feasible solution

Nandini Rai KJSCE LPP 3/30/2024 20

6. Unbounded Solution: A solution which can
increase or decrease the value of
objective function of LP problem
indefinitely, is called unbounded solution

Nandini Rai KJSCE LPP 3/30/2024 21

7. Slack variables: If the constraints of a general
LPP be 𝑛𝑗=1 𝑎𝑖𝑗 𝑥𝑖 ≤ 𝑏𝑖 𝑖 = 1, 2, … . , 𝑚 then
non negative variables 𝑆𝑖 which are introduces
to convert the inequalities ≤ to be equalities
𝑛
𝑗=1 𝑎𝑖𝑗 𝑥𝑖 + 𝑆𝑖 = 𝑏𝑖 𝑖 = 1, 2, … . , 𝑚 are called
slack variables.

Nandini Rai KJSCE LPP 3/30/2024 22

8. Surplus variables: If the constraints of a
general LPP be 𝑛𝑗=1 𝑎𝑖𝑗 𝑥𝑖 ≥ 𝑏𝑖 𝑖 = 1, 2, … . , 𝑚 then
the non negative variables 𝑆𝑖 which are
introduced to convert the inequalities ≥ to be
equalities 𝑛𝑗=1 𝑎𝑖𝑗 𝑥𝑖 − 𝑆𝑖 = 𝑏𝑖 𝑖 = 1, 2, … . , 𝑚
are called surplus variables

Nandini Rai KJSCE LPP 3/30/2024 23

EX 1. Find all the basic solutions to the following
problem,
Maximize 𝑍 = 𝑥1 + 3𝑥2 + 3𝑥3 Subject to
𝑥1 + 2𝑥2 + 3𝑥3 = 4 and 2𝑥1 + 3𝑥2 + 5𝑥3 = 7.
Also find which of the basic solutions are
(i) Basic feasible
(ii) Non degenerate basic feasible and
(iii) Optimal basic feasible

Nandini Rai KJSCE LPP 3/30/2024 24

Solution: No of equation 𝑚 = 2
No of variables 𝑛 = 3
A basic solution can be obtained by setting any of
the 𝑛 − 𝑚 = 1 variable equal to zero and then
solving the constraints equation.
The total no. of basic solution is 𝑛𝐶𝑚 = 3𝐶2 = 3

Nandini Rai KJSCE LPP 3/30/2024 25

 Is the
Values of the Values Is the Is the
Sr. No. Non solution non
Basic basic variables of the solution solution
of Basic basic degenerate
Variable given by the objectiv feasible feasible
Solutio Variable (are all basic
s constraints e ? (are all &
n s variables >
equation function 𝑥𝑗 ≥ 0) Optimal
0)?

Nandini Rai KJSCE LPP 3/30/2024 26

 Is the solution
Values of the Values Is the Is the
Sr. No. Non non
Basic basic variables of the solution solution
of Basic basic degenerate
Variable given by the objectiv feasible? feasible
Solutio Variable (are all basic
s constraints e (are all &
n s variables >
equation function 𝑥𝑗 ≥ 0) Optimal
0)?

𝑥1 + 2𝑥2 = 4
1 𝑥1 , 𝑥2 𝑥3 2𝑥1 + 3𝑥2 = 7 5
𝑥1 = 2, 𝑥2 = 1

Nandini Rai KJSCE LPP 3/30/2024 27

 Is the solution
Values of the Values Is the Is the
Sr. No. Non non
Basic basic variables of the solution solution
of Basic basic degenerate
Variable given by the objectiv feasible? feasible
Solutio Variable (are all basic
s constraints e (are all &
n s variables >
equation function 𝑥𝑗 ≥ 0) Optimal
0)?

𝑥1 + 2𝑥2 = 4
1 𝑥1 , 𝑥2 𝑥3 2𝑥1 + 3𝑥2 = 7 5
𝑥1 = 2, 𝑥2 = 1

𝑥1 + 3𝑥3 = 4
2 𝑥1 , 𝑥3 𝑥2 2𝑥1 + 5𝑥3 = 7 4
𝑥1 = 1, 𝑥3 = 1

Nandini Rai KJSCE LPP 3/30/2024 28

 Is the solution
Values of the Values Is the Is the
Sr. No. Non non
Basic basic variables of the solution solution
of Basic basic degenerate
Variable given by the objectiv feasible? feasible
Solutio Variable (are all basic
s constraints e (are all &
n s variables >
equation function 𝑥𝑗 ≥ 0) Optimal
0)?

𝑥1 + 2𝑥2 = 4
1 𝑥1 , 𝑥2 𝑥3 2𝑥1 + 3𝑥2 = 7 5
𝑥1 = 2, 𝑥2 = 1

𝑥1 + 3𝑥3 = 4
2 𝑥1 , 𝑥3 𝑥2 2𝑥1 + 5𝑥3 = 7 4
𝑥1 = 1, 𝑥3 = 1

2𝑥1 + 3𝑥3 = 4
3 𝑥2 , 𝑥3 𝑥1 3𝑥2 + 5𝑥3 = 7 3
𝑥2 = −1, 𝑥3 = 2

Nandini Rai KJSCE LPP 3/30/2024 29

 Is the solution
Values of the Values Is the Is the
Sr. No. Non non
Basic basic variables of the solution solution
of Basic basic degenerate
Variable given by the objectiv feasible? feasible
Solutio Variable (are all basic
s constraints e (are all &
n s variables >
equation function 𝑥𝑗 ≥ 0) Optimal
0)?

𝑥1 + 2𝑥2 = 4
1 𝑥1 , 𝑥2 𝑥3 2𝑥1 + 3𝑥2 = 7 5 Yes Yes Yes
𝑥1 = 2, 𝑥2 = 1

𝑥1 + 3𝑥3 = 4
2 𝑥1 , 𝑥3 𝑥2 2𝑥1 + 5𝑥3 = 7 4 Yes Yes No
𝑥1 = 1, 𝑥3 = 1

2𝑥1 + 3𝑥3 = 4
3 𝑥2 , 𝑥3 𝑥1 3𝑥2 + 5𝑥3 = 7 3 No No No
𝑥2 = −1, 𝑥3 = 2

Nandini Rai KJSCE LPP 3/30/2024 30

EX 1. Find all the basic solutions to the
following problem,
Maximize 𝑧 = 2𝑥1 − 2𝑥2 + 4𝑥3 − 5𝑥4
Subject to 𝑥1 + 4𝑥2 − 2𝑥3 + 8𝑥4 = 2,
−𝑥1 + 2𝑥2 + 3𝑥3 + 4𝑥4 = 1, 𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0
Also find which of the basic solutions are
(i) Basic feasible
(ii) Non degenerate basic feasible and
(iii) Optimal basic feasible
Nandini Rai KJSCE LPP 3/30/2024 31
Solution: No of equation 𝑚 = 2
No of variables 𝑛 = 4
A basic solution can be obtained by setting any
of the 𝑛 − 𝑚 = 2 variable equal to zero and
then solving the constraints equation.
The total no. of basic solution is
𝑛 𝐶 = 4𝐶 = 6
𝑚 2

Nandini Rai KJSCE LPP 3/30/2024 32

 Is the
Values of Is the
Sr. No. of Values of the basic solution Is the solution non
Basic Non basic the solution
Basic variables given by the feasible? degenerate (are all
Variables Variables objective feasible &
Solution constraints equation (are all basic variables > 0)?
function Optimal
𝑥𝑗 ≥ 0)

Nandini Rai KJSCE LPP 3/30/2024 33

 Is the
Values of Is the
Sr. No. of Values of the basic solution Is the solution non
Basic Non basic the solution
Basic variables given by the feasible? degenerate (are all
Variables Variables objective feasible &
Solution constraints equation (are all basic variables > 0)?
function Optimal
𝑥𝑗 ≥ 0)

𝑥1 + 4𝑥2 = 2
1 𝑥1 , 𝑥2 𝑥3 , 𝑥4 −𝑥1 + 2𝑥2 = 1 −1 Yes No
𝑥1 = 0, 𝑥2 = 1 2

Nandini Rai KJSCE LPP 3/30/2024 34

 Is the
Values of Is the
Sr. No. of Values of the basic solution Is the solution non
Basic Non basic the solution
Basic variables given by the feasible? degenerate (are all
Variables Variables objective feasible &
Solution constraints equation (are all basic variables > 0)?
function Optimal
𝑥𝑗 ≥ 0)

𝑥1 + 4𝑥2 = 2
1 𝑥1 , 𝑥2 𝑥3 , 𝑥4 −𝑥1 + 2𝑥2 = 1 −1 Yes No
𝑥1 = 0, 𝑥2 = 1 2

𝑥1 − 2𝑥3 = 2
2 𝑥1 , 𝑥3 𝑥2 , 𝑥4 −𝑥1 + 3𝑥3 = 1 28 Yes yes
𝑥1 = 8, 𝑥3 = 3

Nandini Rai KJSCE LPP 3/30/2024 35

 Is the
Values of Is the
Sr. No. of Values of the basic solution Is the solution non
Basic Non basic the solution
Basic variables given by the feasible? degenerate (are all
Variables Variables objective feasible &
Solution constraints equation (are all basic variables > 0)?
function Optimal
𝑥𝑗 ≥ 0)

𝑥1 + 4𝑥2 = 2
1 𝑥1 , 𝑥2 𝑥3 , 𝑥4 −𝑥1 + 2𝑥2 = 1 −1.5 Yes
No
𝑥1 = 0, 𝑥2 = 1 2

𝑥1 − 2𝑥3 = 2
2 𝑥1 , 𝑥3 𝑥2 , 𝑥4 −𝑥1 + 3𝑥3 = 1 28 Yes Yes
𝑥1 = 8, 𝑥3 = 3

4𝑥2 − 2𝑥3 = 2
3 𝑥2 , 𝑥3 𝑥1 , 𝑥4 2𝑥2 + 3𝑥3 = 1 −1 Yes No
𝑥3 = 0, 𝑥2 = 1 2

Nandini Rai KJSCE LPP 3/30/2024 36

 Is the
Values of Is the
Sr. No. of Values of the basic solution Is the solution non
Basic Non basic the solution
Basic variables given by the feasible? degenerate (are all
Variables Variables objective feasible &
Solution constraints equation (are all basic variables > 0)?
function Optimal
𝑥𝑗 ≥ 0)

𝑥1 + 4𝑥2 = 2
1 𝑥1 , 𝑥2 𝑥3 , 𝑥4 −𝑥1 + 2𝑥2 = 1 −1 Yes No
𝑥1 = 0, 𝑥2 = 1 2

𝑥1 − 2𝑥3 = 2
2 𝑥1 , 𝑥3 𝑥2 , 𝑥4 −𝑥1 + 3𝑥3 = 1 28 Yes yes
𝑥1 = 8, 𝑥3 = 3

4𝑥2 − 2𝑥3 = 2
3 𝑥2 , 𝑥3 𝑥1 , 𝑥4 2𝑥2 + 3𝑥3 = 1 −1 Yes No
𝑥3 = 0, 𝑥2 = 1 2

𝑥1 + 8𝑥4 = 2,
𝑥1 , 𝑥4 𝑥2 , 𝑥3
4 −𝑥1 + 4𝑥4 = 1 −1.25 Yes No
𝑥1 = 0, 𝑥4 = 1 4

Nandini Rai KJSCE LPP 3/30/2024 37

 Is the
Values of Is the
Sr. No. of Values of the basic solution Is the solution non
Basic Non basic the solution
Basic variables given by the feasible? degenerate (are all
Variables Variables objective feasible &
Solution constraints equation (are all basic variables > 0)?
function Optimal
𝑥𝑗 ≥ 0)

𝑥1 + 4𝑥2 = 2
1 𝑥1 , 𝑥2 𝑥3 , 𝑥4 −𝑥1 + 2𝑥2 = 1 −1.5 Yes No
𝑥1 = 0, 𝑥2 = 1 2

𝑥1 − 2𝑥3 = 2
2 𝑥1 , 𝑥3 𝑥2 , 𝑥4 −𝑥1 + 3𝑥3 = 1 28 Yes Yes
𝑥1 = 8, 𝑥3 = 3

4𝑥2 − 2𝑥3 = 2
3 𝑥2 , 𝑥3 𝑥1 , 𝑥4 2𝑥2 + 3𝑥3 = 1 −1 Yes No
𝑥3 = 0, 𝑥2 = 1 2

𝑥1 + 8𝑥4 = 2,
𝑥1 , 𝑥4 𝑥2 , 𝑥3
4 −𝑥1 + 4𝑥4 = 1 −1.25 Yes No
𝑥1 = 0, 𝑥4 = 1 4

4𝑥2 + 8𝑥4 = 2
𝑥2 , 𝑥4 𝑥1 , 𝑥3
5 2𝑥2 + 4𝑥4 = 1   
Unbounded

Nandini Rai KJSCE LPP 3/30/2024 38

 Is the
Values of Is the
Sr. No. of Values of the basic solution Is the solution non
Basic Non basic the solution
Basic variables given by the feasible? degenerate (are all
Variables Variables objective feasible &
Solution constraints equation (are all basic variables > 0)?
function Optimal
𝑥𝑗 ≥ 0)

𝑥1 + 4𝑥2 = 2
1 𝑥1 , 𝑥2 𝑥3 , 𝑥4 −𝑥1 + 2𝑥2 = 1 −1 Yes No
𝑥1 = 0, 𝑥2 = 1 2

𝑥1 − 2𝑥3 = 2
2 𝑥1 , 𝑥3 𝑥2 , 𝑥4 −𝑥1 + 3𝑥3 = 1 28 Yes Yes
𝑥1 = 8, 𝑥3 = 3

4𝑥2 − 2𝑥3 = 2
3 𝑥2 , 𝑥3 𝑥1 , 𝑥4 2𝑥2 + 3𝑥3 = 1 −1 Yes No
𝑥3 = 0, 𝑥2 = 1 2

𝑥1 + 8𝑥4 = 2,
𝑥1 , 𝑥4 𝑥2 , 𝑥3
4 −𝑥1 + 4𝑥4 = 1 −1.25 Yes No
𝑥1 = 0, 𝑥4 = 1 4

4𝑥2 + 8𝑥4 = 2
𝑥2 , 𝑥4 𝑥1 , 𝑥3
5 2𝑥2 + 4𝑥4 = 1   
Unbounded

−2𝑥3 + 8𝑥4 = 2
6 𝑥3 , 𝑥4 𝑥1 , 𝑥2 3𝑥3 + 𝑥4 = 12 −12.5 Yes No
𝑥3 = 0, 𝑥4 = 1 4

Nandini Rai KJSCE LPP 3/30/2024 39

 Is the
Values of Is the
Sr. No. of Values of the basic solution Is the solution
Basic Non basic the solution
Basic variables given by the feasible? degenerate (are all
Variables Variables objective feasible &
Solution constraints equation (are all basic variables > 0)?
function Optimal
𝑥𝑗 ≥ 0)

𝑥1 + 4𝑥2 = 2
1 𝑥1 , 𝑥2 𝑥3 , 𝑥4 −𝑥1 + 2𝑥2 = 1 −1 Yes No No
𝑥1 = 0, 𝑥2 = 1 2

𝑥1 − 2𝑥3 = 2
2 𝑥1 , 𝑥3 𝑥2 , 𝑥4 −𝑥1 + 3𝑥3 = 1 28 Yes Yes Yes
𝑥1 = 8, 𝑥3 = 3

4𝑥2 − 2𝑥3 = 2
3 𝑥2 , 𝑥3 𝑥1 , 𝑥4 2𝑥2 + 3𝑥3 = 1 −1 Yes No No
𝑥3 = 0, 𝑥2 = 1 2

𝑥1 + 8𝑥4 = 2,
𝑥1 , 𝑥4 𝑥2 , 𝑥3
4 −𝑥1 + 4𝑥4 = 1 −1.25 Yes No No
𝑥1 = 0, 𝑥4 = 1 4

4𝑥2 + 8𝑥4 = 2
𝑥2 , 𝑥4 𝑥1 , 𝑥3
5 2𝑥2 + 4𝑥4 = 1    
Unbounded

−2𝑥3 + 8𝑥4 = 2
6 𝑥3 , 𝑥4 𝑥1 , 𝑥2 3𝑥3 + 𝑥4 = 12 −1.25 Yes No No
𝑥3 = 0, 𝑥4 = 1 4

Nandini Rai KJSCE LPP 3/30/2024 40

Find all basic solutions to the following
problem. Which of them are basic feasible,
non-degenerate, infeasible basic and optimal
feasible solutions?
Maximize 𝑧 = 2𝑥1 + 3𝑥2
Subject to 𝑥1 + 3𝑥2 ≤ 6,
3𝑥1 + 2𝑥2 ≤ 6, 𝑥1 , 𝑥2 ≥ 0

Nandini Rai KJSCE LPP 3/30/2024 41

Solution: First we convert the given problem to
standard form
Maximize 𝑧 = 2𝑥1 + 3𝑥2 + 0𝑆1 + 0𝑆2
Subject to 𝑥1 + 3𝑥2 + 𝑆1 + 0𝑆2 = 6,
3𝑥1 + 2𝑥2 + 0𝑆1 + 𝑆2 = 6,
𝑥1 , 𝑥2 , 𝑆1 , 𝑆2 ≥ 0

Nandini Rai KJSCE LPP 3/30/2024 42

 No of equation 𝑚 = 2
No of variables 𝑛 = 4
A basic solution can be obtained by setting any
of the 𝑛 − 𝑚 = 2 variable equal to zero and
then solving the constraints equation.
The total no. of basic solution is
𝑛 𝐶 = 4𝐶 = 6
𝑚 2

Nandini Rai KJSCE LPP 3/30/2024 43

 Is the
Values of Is the
Sr. No. of Values of the basic solution Is the solution
Basic Non basic the solution
Basic variables given by the feasible? degenerate (are all
Variables Variables objective feasible &
Solution constraints equation (are all basic variables > 0)?
function Optimal
𝑥𝑗 ≥ 0)

𝑥1 + 3𝑥2 = 6,
3𝑥1 + 2𝑥2 = 6
1 𝑥1 , 𝑥2 𝑆1 , 𝑆2 6 12 48 Yes Yes No
𝑥1 = , 𝑥2 = , 7
7 7

𝑥1 + 𝑆1 = 6,
3𝑥1 + 0𝑆1 = 6
2 𝑥1 , 𝑆1 𝑥2 , 𝑆2 4 Yes Yes No
𝑥1 = 2, 𝑆1 = 4

𝑥1 + 0𝑆2 = 6,
3𝑥1 + 𝑆2 = 6
3 𝑥1 , 𝑆2 𝑥2 , 𝑆1 12 Yes No Yes
𝑥1 = 6, 𝑆2 = −12,

3𝑥2 + 𝑆1 = 6,
𝑥2 , 𝑆1 𝑥1 , 𝑆2 2𝑥2 + 0𝑆1 = 6
4 9 Yes No No
𝑥2 = 3, 𝑆1 = −3,

3𝑥2 + 0𝑆2 = 6,
𝑥2 , 𝑆2 𝑥1 , 𝑆1 2𝑥2 + 𝑆2 = 6
5 6 Yes Yes No
𝑥2 = 2, 𝑆2 = 2

𝑆1 + 0𝑆2 = 6,
6 𝑆1 , 𝑆2 𝑥1 , 𝑥2 0𝑆1 + 𝑆2 = 6 0 Yes Yes No
𝑆1 = 6, 𝑆2 = 6,

Nandini Rai KJSCE LPP 3/30/2024 44

Is the solution 𝑥1 = 1, 𝑥2 = 1 2 , 𝑥3 = 0, 𝑥4 =
0, 𝑥5 = 0 a basic solution of the following
problem?
𝑥1 + 2𝑥2 + 𝑥3 + 𝑥4 = 2 ,
𝑥1 + 2𝑥2 + 1 2 𝑥3 + 𝑥5 = 2

Nandini Rai KJSCE LPP 3/30/2024 45