Professional Documents
Culture Documents
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
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.
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
Thank
You