Mini Project

By: Ketaki Limaye

Yash Dhadve
Nakul Bahurupi
Sakshi Gole
Revised Simplex Method
 Introduction
General Overview

The revised simplex method is technically equivalent to the

traditional simplex method, but it is implemented
differently. It retains a representation of a basis of the
matrix containing the constraints, rather than a table that
directly depicts the constraints scaled to a set of
fundamental variables.
 Basics Of The Topic
First goals
Second goals
The revised simplex method is
a linear programming algorithm
It is also more efficient when the
that improves
solution
upon the original simplex
method by reducing the changes only slightly
number of computations between iterations.
required to solve a problem .

 Process
01 02 03 04
What is
How to solve Applications
revised Conclusion
the problem of simplex
simplex
step by step method
method
 Steps
. Step 1: Formalize the problem in standard form – I
Confirm that all bi ≥ 0. Maximization should be the objective
function.
Inequalities are converted to equations using non-negative slack
variables.
The first constraint equation is also treated as the objective
function.
2. Step 2: In the revised simplex form, build the starting table.
Using appropriate notation, express the result of step 1 as a matrix.
 Steps

Step 3: For a₁⁽¹⁾ and a₂⁽¹⁾, Compute Δj.

Step 4: Conduct an optimality test.
Step 5: Determine the Xk column vector.
Step 6: Find the outgoing vector. We’re not supposed to do
any calculations for the Z-row.
Step 7: Choose a better solution.
Example of the simplex method
Solve the problem using the Revised simplex method
Max Z = 2x₁ + x₂
Subject to 3x₁ + 4x₂ ≤ 6
6x₁ + x₂ ≤ 3 and x₁, x₂ ≥ 0 Solution:
Given that,
Max Z = 2x1 + x2+ 0s1+ 0s2
Subject to
3x1 + 4x2 + s1 = 6
6x1 + x2 + s2 = 3
and x1, x2, s1, s2 ≥ 0
1. Step 2: 

1. Z’s column vector is commonly denoted by the e1 matrix B1, which is usually written as B1 =
[β0(1), β1(1), β2(1) … βn(1)]. As a result, the column β0(1), β1(1), β2(1) forms the basis
matrix B1 (whose inverse B1-1 is also B1)

Basic B₁⁻¹
XB Xk XB/Xk
Variables E₁ (z) β₁⁽¹⁾ β₂⁽¹⁾
Z 1 0 0 0
s₁ 0 1 0 6
s₂ 0 0 1 3
 a₁⁽¹⁾ a₂⁽¹⁾
-2 -1
3 4
6 1

Step 3 :
Δ1 = first row of B1-1 × a1(1) = 1 × -2 + 0 × 3 + 0 × 6 = -2
Δ2 = first row of B1-1 * a2(1) = 1 × -1 + 0 × 4 + 0 × 1 = -1
Step 4 :
Δ1 and Δ2 are both negative. Determine the entering vector by
finding the largest negative value.
As a result, the most negative value is Δ1 = -2. This means that the
incoming vector is a1(1) (x1).
Step 5 – Determination of the column vector Xk
Xk = B1 -1 * a1(1)
Step 6:
B₁⁻¹
Basic
XB Xk XB/Xk
Variables E₁ (z) β₁⁽¹⁾ β₂⁽¹⁾

–
Z 1 0 0 0 -2
2
s₁ 0 1 0 6 3
½–
s₂ 0 0 1 3 6 – Incoming
Outgoing
Step 7:
Because e1 will never change and x1 will arrive, place it outside the
rectangle boundary.

β₁⁽¹⁾ β₂⁽¹⁾ XB X₁
R₁
-2
R₂ 0 0 0
3
R₃ 1 0 6
6
0 1 3

Set the pivot element to 1 and the column elements to 0 for each column
β₁⁽¹⁾ β₂⁽¹⁾ XB X₁
R₁
0
R₂ 0 1/3 1
0
R₃ 1 -1/2 9/2
1
0 1/6 1/2
 B₁⁻¹
Basic
XB Xk XB/Xk
Variables
e₁(z) β₁⁽¹⁾ β₂⁽¹⁾

Z 1 0 1/3 1
s₁ 0 1 -1/2 9/2
s₂ 0 0 1/6 1/2

a₄⁽¹⁾ a₂⁽¹⁾

0 -1
0 4
1 1
 Δ4 = 1 × 0 + 0 × 0 + 1/3 × 1 = 1/3
Δ2 = 1 × -1 + 0 × 4 + ⅓ × 1 = -⅔
Hence, Δ2 is most negative. As a result, a2(1) is an incoming vector.
Determine the column vector.

Find the outgoing vector.

Basic B₁⁻¹
XB Xk XB/Xk
Variables e₁ (z) β₁⁽¹⁾ β₂⁽¹⁾
-⅔ –
Z 1 0 1/3 1
7/2 9/7 –
s₁ 0 1 -1/2 9/2
⅙– Outgoing
s₂ 0 0 1/6 1/2
Incoming 3
 B₁⁻¹
Basic
XB Xk XB/Xk
Variables e₁ (z) β₁⁽¹⁾ β₂⁽¹⁾

-⅔ –
Z 1 4/21 5/21 13/7
7/2 9/7 –
s₁ 0 2/7 -1/7 9/7
⅙– Outgoing
s₂ 0 -1/21 8/42 2/7
Incoming 3

a₄⁽¹⁾ a₃⁽¹⁾
0 0
0 1
1 0
 Δ4 = 1 × 0 + 4/21 × 0 + 5/21 × 1 = 5/21
Δ3 = 1 × 0 + 4/21 × 1 + 5/21 × 0 = 4/21
Thus, Δ4 and Δ3 are positive.
Hence, the optimal solution is Max Z = 13/7, x1= 2/7, x2 = 9/7.
 Advantages

The revised simplex method offers several advantages over the

original simplex
method. It requires fewer computations , which makes it faster
and more efficient.
It also maintains a feasible basis throughout the iterations, which
reduces the like hood of errors and simplifies the calculations.
 Applications

The revised simplex method is also used in the

development of mathematical models for
decision-making , such as in the analysis of
market trends and forecasting future demand.
 Conclusion

The simplex algorithm is an iterative procedure

for solving linear programming problems in a
finite number of steps.
It consists Having trials basic feasible solution to
constraint equation.
Testing whether an optimal solution.
Improving the first trial solution by a set of rules
and repeating the processes until an optimal
solution is obtained.

Thank
You