انعام سمير صادق1
انعام سمير صادق1
انعام سمير صادق1
Q1//
MAX Z = 3x1 + 5x2 + 4x3
subject to
2x1 + 3x2 <= 8
2x2 + 5x3 <= 10
3x1 + 2x2 + 4x3 <= 15
and x1,x2,x3 >= 0
Solution:
Problem is
Max Z = 3 x1 + 5 x2 + 4 x3
subject to
2 x1 + 3 x2 ≤8
2 x2 + 5 x3 ≤ 10
3 x1 + 2 x2 + 4 x3 ≤ 15
and x1,x2,x3≥0;
The problem is converted to canonical form by adding slack, surplus and artificial
variables as appropiate
Iteration-1 Cj 3 5 4 0 0 0
MinRatio
B CB XB x1 x2 x3 S1 S2 S3
XB/x2
S1 0 8 2 (3) 0 1 0 0 8/3=2.6667→
S2 0 10 0 2 5 0 1 0 10/2=5
S3 0 15 3 2 4 0 0 1 15/2=7.5
Z=0 Zj 0 0 0 0 0 0
Zj-Cj -3 -5↑ -4 0 0 0
Negative minimum Zj-Cj is -5 and its column index is 2. So, the entering variable is x2.
Minimum ratio is 2.6667 and its row index is 1. So, the leaving basis variable is S1.
R1(new)=R1(old)÷3
R1(old) = 8 2 3 0 1 0 0
R2(new)=R2(old) - 2R1(new)
R2(old) = 10 0 2 5 0 1 0
R3(new)=R3(old) - 2R1(new)
R3(old) = 15 3 2 4 0 0 1
Iteration-2 Cj 3 5 4 0 0 0
MinRatio
B CB XB x1 x2 x3 S1 S2 S3
XB/x3
Minimum ratio is 0.9333 and its row index is 2. So, the leaving basis variable is S2.
R2(new)=R2(old)÷5
R2(old) = 4.6667 -1.3333 0 5 -0.6667 1 0
R1(new)=R1(old)
R1(old) = 2.6667 0.6667 1 0 0.3333 0 0
R3(new)=R3(old) - 4R2(new)
R3(old) = 9.6667 1.6667 0 4 -0.6667 0 1
Iteration-3 Cj 3 5 4 0 0 0
MinRatio
B CB XB x1 x2 x3 S1 S2 S3
XB/x1
Minimum ratio is 2.1707 and its row index is 3. So, the leaving basis variable is S3.
R3(new)=R3(old)÷2.7333
R3(old) = 5.9333 2.7333 0 0 -0.1333 -0.8 1
R1(new)=R1(old) - 0.6667R3(new)
R1(old) = 2.6667 0.6667 1 0 0.3333 0 0
R2(new)=R2(old) + 0.2667R3(new)
R2(old) = 0.9333 -0.2667 0 1 -0.1333 0.2 0
Iteration-4 Cj 3 5 4 0 0 0
B CB XB x1 x2 x3 S1 S2 S3 MinRatio
Max Z=18.6585
Q2//
MAX Z = 4x1 + 3x2
subject to
2x1 + x2 <= 1000
x1 + x2 <= 800
x1 <= 400
x2 <= 700
and x1,x2 >= 0
Solution:
Problem is
Max Z = 4 x1 + 3 x2
subject to
2 x1 + x2 ≤ 1000
x1 + x2 ≤ 800
x1 ≤ 400
x2 ≤ 700
and x1,x2≥0;
The problem is converted to canonical form by adding slack, surplus and artificial
variables as appropiate
MinRatio
B CB XB x1 x2 S1 S2 S3 S4
XB/x1
S1 0 1000 2 1 1 0 0 0 1000/2=500
S2 0 800 1 1 0 1 0 0 800/1=800
S4 0 700 0 1 0 0 0 1 ---
Z=0 Zj 0 0 0 0 0 0
Zj-Cj -4↑ -3 0 0 0 0
Negative minimum Zj-Cj is -4 and its column index is 1. So, the entering variable is x1.
Minimum ratio is 400 and its row index is 3. So, the leaving basis variable is S3.
R3(new)=R3(old)
R3(old) = 400 1 0 0 0 1 0
R3(new)=R3(old) 400 1 0 0 0 1 0
R1(new)=R1(old) - 2R3(new)
R1(old) = 1000 2 1 1 0 0 0
R3(new) = 400 1 0 0 0 1 0
2×R3(new) = 800 2 0 0 0 2 0
R2(new)=R2(old) - R3(new)
R2(old) = 800 1 1 0 1 0 0
R3(new) = 400 1 0 0 0 1 0
R4(new)=R4(old) 700 0 1 0 0 0 1
Iteration-2 Cj 4 3 0 0 0 0
MinRatio
B CB XB x1 x2 S1 S2 S3 S4
XB/x2
S2 0 400 0 1 0 1 -1 0 400/1=400
x1 4 400 1 0 0 0 1 0 ---
S4 0 700 0 1 0 0 0 1 700/1=700
Z=1600 Zj 4 0 0 0 4 0
Zj-Cj 0 -3↑ 0 0 4 0
Negative minimum Zj-Cj is -3 and its column index is 2. So, the entering variable is x2.
Minimum ratio is 200 and its row index is 1. So, the leaving basis variable is S1.
R1(new)=R1(old)
R1(old) = 200 0 1 1 0 -2 0
R1(new)=R1(old) 200 0 1 1 0 -2 0
R2(new)=R2(old) - R1(new)
R2(old) = 400 0 1 0 1 -1 0
R1(new) = 200 0 1 1 0 -2 0
R3(new)=R3(old) 400 1 0 0 0 1 0
R4(new)=R4(old) - R1(new)
R4(old) = 700 0 1 0 0 0 1
R1(new) = 200 0 1 1 0 -2 0
Iteration-3 Cj 4 3 0 0 0 0
MinRatio
B CB XB x1 x2 S1 S2 S3 S4
XB/S3
x2 3 200 0 1 1 0 -2 0 ---
x1 4 400 1 0 0 0 1 0 400/1=400
S4 0 500 0 0 -1 0 2 1 500/2=250
Z=2200 Zj 4 3 3 0 -2 0
Zj-Cj 0 0 3 0 -2↑ 0
Negative minimum Zj-Cj is -2 and its column index is 5. So, the entering variable is S3.
Minimum ratio is 200 and its row index is 2. So, the leaving basis variable is S2.
R2(new)=R2(old)
R2(old) = 200 0 0 -1 1 1 0
R2(new)=R2(old) 200 0 0 -1 1 1 0
R1(new)=R1(old) + 2R2(new)
R1(old) = 200 0 1 1 0 -2 0
R2(new) = 200 0 0 -1 1 1 0
2×R2(new) = 400 0 0 -2 2 2 0
R3(new)=R3(old) - R2(new)
R3(old) = 400 1 0 0 0 1 0
R2(new) = 200 0 0 -1 1 1 0
R4(new)=R4(old) - 2R2(new)
R4(old) = 500 0 0 -1 0 2 1
R2(new) = 200 0 0 -1 1 1 0
2×R2(new) = 400 0 0 -2 2 2 0
Iteration-4 Cj 4 3 0 0 0 0
B CB XB x1 x2 S1 S2 S3 S4 MinRatio
x2 3 600 0 1 -1 2 0 0
S3 0 200 0 0 -1 1 1 0
x1 4 200 1 0 1 -1 0 0
S4 0 100 0 0 1 -2 0 1
Z=2600 Zj 4 3 1 2 0 0
Zj-Cj 0 0 1 2 0 0
Max Z=2600
Q3//
MIN Z = 5x1 + 3x2
subject to
2x1 + 4x2 <= 12
2x1 + 2x2 = 10
5x1 + 2x2 >= 10
and x1,x2 >= 0
Solution:
Problem is
Min Z = 5 x1 + 3 x2
subject to
2 x1 + 4 x2 ≤ 12
2 x1 + 2 x2 = 10
5 x1 + 2 x2 ≥ 10
and x1,x2≥0;
The problem is converted to canonical form by adding slack, surplus and artificial
variables as appropiate
3. As the constraint-3 is of type '≥' we should subtract surplus variable S2 and add
artificial variable A2
Iteration-1 Cj 5 3 0 0 M M
MinRatio
B CB XB x1 x2 S1 S2 A1 A2
XBx1
S1 0 12 2 4 1 0 0 0 122=6
A1 M 10 2 2 0 0 1 0 102=5
A2 M 10 (5) 2 0 -1 0 1 105=2→
Z=20M Zj 7M 4M 0 -M M M
Minimum ratio is 2 and its row index is 3. So, the leaving basis variable is A2.
R3(new)=R3(old)÷5
R3(old) = 10 5 2 0 -1 0
R1(new)=R1(old) - 2R3(new)
R1(old) = 12 2 4 1 0 0
R2(new)=R2(old) - 2R3(new)
R2(old) = 10 2 2 0 0 1
Iteration-2 Cj 5 3 0 0 M
MinRatio
B CB XB x1 x2 S1 S2 A1
XBx2
Minimum ratio is 2.5 and its row index is 1. So, the leaving basis variable is S1.
R1(new)=R1(old)÷3.2
R1(old) = 8 0 3.2 1 0.4 0
R2(new)=R2(old) - 1.2R1(new)
R2(old) = 6 0 1.2 0 0.4 1
R3(new)=R3(old) - 0.4R1(new)
R3(old) = 2 1 0.4 0 -0.2 0
Iteration-3 Cj 5 3 0 0 M
MinRatio
B CB XB x1 x2 S1 S2 A1
XBS2
Minimum ratio is 12 and its row index is 2. So, the leaving basis variable is A1.
R2(new)=R2(old)÷0.25
R2(old) = 3 0 0 -0.375 0.25
R2(new)=R2(old)÷0.25 12 0 0 -1.5 1
R1(new)=R1(old) - 0.125R2(new)
R1(old) = 2.5 0 1 0.3125 0.125
R2(new) = 12 0 0 -1.5 1
R3(new)=R3(old) + 0.25R2(new)
R3(old) = 1 1 0 -0.125 -0.25
R2(new) = 12 0 0 -1.5 1
Iteration-4 Cj 5 3 0 0
B CB XB x1 x2 S1 S2 MinRatio
x2 3 1 0 1 0.5 0
S2 0 12 0 0 -1.5 1
x1 5 4 1 0 -0.5 0
Z=23 Zj 5 3 -1 0
Zj-Cj 0 0 -1 0
Since all Zj-Cj≤0
Min Z=23
Q4//
MAX Z = x1 + 2x2 + 3x3 - x4
subject to
x1 + 2x2 + 3x3 = 15
2x1 + x2 + 5x3 = 20
x1 + 2x2 + x3 + x4 = 10
and x1,x2,x3,x4 >= 0
Solution:
Problem is
Max Z = x1 + 2 x2 + 3 x3 - x4
subject to
x1 + 2 x2 + 3 x3 = 15
2 x1 + x2 + 5 x3 = 20
x1 + 2 x2 + x3 + x4 = 10
and x1,x2,x3,x4≥0;
The problem is converted to canonical form by adding slack, surplus and artificial
variables as appropiate
MinRatio
B CB XB x1 x2 x3 x4 A1 A2 A3
XBx3
A1 -M 15 1 2 3 0 1 0 0 15/3=5
A2 -M 20 2 1 (5) 0 0 1 0 20/5=4→
A3 -M 10 1 2 1 1 0 0 1 10/1=10
Negative minimum Zj-Cj is -9M-3 and its column index is 3. So, the entering variable is x3.
Minimum ratio is 4 and its row index is 2. So, the leaving basis variable is A2.
R2(new)=R2(old)÷5
R2(old) = 20 2 1 5 0 0 0
R1(new)=R1(old) - 3R2(new)
R1(old) = 15 1 2 3 0 1 0
R3(new)=R3(old) - R2(new)
R3(old) = 10 1 2 1 1 0 1
MinRatio
B CB XB x1 x2 x3 x4 A1 A3
XBx2
Negative minimum Zj-Cj is -3.2M-1.4 and its column index is 2. So, the entering variable
is x2.
Minimum ratio is 2.1429 and its row index is 1. So, the leaving basis variable is A1.
R1(new)=R1(old)÷1.4
R1(old) = 3 -0.2 1.4 0 0 0
R2(new)=R2(old) - 0.2R1(new)
R2(old) = 4 0.4 0.2 1 0 0
R3(new)=R3(old) - 1.8R1(new)
R3(old) = 6 0.6 1.8 0 1 1
MinRatio
B CB XB x1 x2 x3 x4 A3
XBx4
Z=-2.1429M+15 Zj -0.8571M+1 2 3 -M -M
Negative minimum Zj-Cj is -M+1 and its column index is 4. So, the entering variable is x4.
Minimum ratio is 2.1429 and its row index is 3. So, the leaving basis variable is A3.
R3(new)=R3(old)
R3(old) = 2.1429 0.8571 0 0 1
R1(new)=R1(old)
R1(old) = 2.1429 -0.1429 1 0 0
R2(new)=R2(old)
R2(old) = 3.5714 0.4286 0 1 0
MinRatio
B CB XB x1 x2 x3 x4
XB/x1
Z=12.8571 Zj 0.1429 2 3 -1
Zj-Cj -0.8571↑ 0 0 0
Negative minimum Zj-Cj is -0.8571 and its column index is 1. So, the entering variable
is x1.
Minimum ratio is 2.5 and its row index is 3. So, the leaving basis variable is x4.
R3(new)=R3(old)÷0.8571
R3(old) = 2.1429 0.8571 0 0 1
R1(new)=R1(old) + 0.1429R3(new)
R1(old) = 2.1429 -0.1429 1 0 0
R2(new)=R2(old) - 0.4286R3(new)
R2(old) = 3.5714 0.4286 0 1 0
B CB XB x1 x2 x3 x4 MinRatio
x2 2 2.5 0 1 0 0.1667
x3 3 2.5 0 0 1 -0.5
x1 1 2.5 1 0 0 1.1667
Z=15 Zj 1 2 3 0
Zj-Cj 0 0 0 1
Max Z=15
Q5//
MAX Z = 3x1 + 9x2
subject to
x1 + 4x2 <= 8
x1 + 2x2 <= 4
and x1,x2 >= 0
Solution:
Problem is
Max Z = 3 x1 + 9 x2
subject to
x1 + 4 x2 ≤ 8
x1 + 2 x2 ≤ 4
and x1,x2≥0;
The problem is converted to canonical form by adding slack, surplus and artificial
variables as appropiate
Iteration-1 Cj 3 9 0 0
MinRatio
B CB XB x1 x2 S1 S2
XBx2
S1 0 8 1 4 1 0 8/4=2
S2 0 4 1 (2) 0 1 4/2=2→
Z=0 Zj 0 0 0 0
Zj-Cj -3 -9↑ 0 0
Negative minimum Zj-Cj is -9 and its column index is 2. So, the entering variable is x2.
Minimum ratio is 2 and its row index is 2. So, the leaving basis variable is S2.
R2(new)=R2(old)÷2
R2(old) = 4 1 2 0 1
R1(new)=R1(old) - 4R2(new)
R1(old) = 8 1 4 1 0
4×R2(new) = 8 2 4 0 2
R1(new)=R1(old) - 4R2(new) 0 -1 0 1 -2
Iteration-2 Cj 3 9 0 0
B CB XB x1 x2 S1 S2 MinRatio
S1 0 0 -1 0 1 -2
x2 9 2 0.5 1 0 0.5
Max Z=18
Q6//
MAX Z = 3x1 + 2x2 + x3
subject to
2x1 + 5x2 + x3 = 12
3x1 + 4x2 = 11
and x2,x3 >= 0 and x1 unrestricted in sign
Solution:
Problem is
Max Z = 3 x1 + 2 x2 + x3
subject to
2 x1 + 5 x2 + x3 = 12
3 x1 + 4 x2 = 11
and x2,x3≥0;x1 unrestricted in sign
so that x1=x1′-x1′′;x1′,x1′′≥0.
The problem is converted to canonical form by adding slack, surplus and artificial
variables as appropiate
Iteration-1 Cj 3 -3 2 1 -M -M
MinRatio
B CB XB x1′ x1′′ x2 x3 A1 A2
XB/x2
A1 -M 12 2 -2 (5) 1 1 0 12/5=2.4→
A2 -M 11 3 -3 4 0 0 1 11/4=2.75
Negative minimum Zj-Cj is -9M-2 and its column index is 3. So, the entering variable is x2.
Minimum ratio is 2.4 and its row index is 1. So, the leaving basis variable is A1.
R1(new)=R1(old)÷5
R1(old) = 12 2 -2 5 1 0
Iteration-2 Cj 3 -3 2 1 -M
MinRatio
B CB XB x1′ x1′′ x2 x3 A2
XB/x1′
Negative minimum Zj-Cj is -1.4M-2.2 and its column index is 1. So, the entering variable
is x1′.
Minimum ratio is 1 and its row index is 2. So, the leaving basis variable is A2.
R2(new)=R2(old)÷1.4
R2(old) = 1.4 1.4 -1.4 0 -0.8
R2(new)=R2(old)÷1.4 1 1 -1 0 -0.5714
R1(new)=R1(old) - 0.4R2(new)
R1(old) = 2.4 0.4 -0.4 1 0.2
R2(new) = 1 1 -1 0 -0.5714
MinRatio
B CB XB x1′ x1′′ x2 x3
XB/x3
x2 2 2 0 0 1 (0.4286) 2/0.4286=4.6667→
Z=7 Zj 3 -3 2 -0.8571
Zj-Cj 0 0 0 -1.8571↑
Negative minimum Zj-Cj is -1.8571 and its column index is 4. So, the entering variable
is x3.
Minimum ratio is 4.6667 and its row index is 1. So, the leaving basis variable is x2.
R1(new)=R1(old)÷0.4286
R1(old) = 2 0 0 1 0.4286
R2(new)=R2(old) + 0.5714R1(new)
R2(old) = 1 1 -1 0 -0.5714
Iteration-4 Cj 3 -3 2 1
x3 1 4.6667 0 0 2.3333 1
Z=15.6667 Zj 3 -3 6.3333 1
Zj-Cj 0 0 4.3333 0
Since all Zj-Cj≥0
Max Z=15.6667
Q7//
MAX Z = 6x1 + 4x2
subject to
2x1 + 3x2 <= 30
3x1 + 2x2 <= 24
x1 + x2 >= 3
and x1,x2 >= 0
Solution:
Problem is
Max Z = 6 x1 + 4 x2
subject to
2 x1 + 3 x2 ≤ 30
3 x1 + 2 x2 ≤ 24
x1 + x2 ≥ 3
and x1,x2≥0;
The problem is converted to canonical form by adding slack, surplus and artificial
variables as appropiate
3. As the constraint-3 is of type '≥' we should subtract surplus variable S3 and add
artificial variable A1
MinRatio
B CB XB x1 x2 S1 S2 S3 A1
XB/x1
S1 0 30 2 3 1 0 0 0 30/2=15
S2 0 24 3 2 0 1 0 0 24/3=8
A1 -M 3 (1) 1 0 0 -1 1 3/1=3→
Z=-3M Zj -M -M 0 0 M -M
Negative minimum Zj-Cj is -M-6 and its column index is 1. So, the entering variable is x1.
Minimum ratio is 3 and its row index is 3. So, the leaving basis variable is A1.
R3(new)=R3(old)
R3(old) = 3 1 1 0 0 -1
R3(new)=R3(old) 3 1 1 0 0 -1
R1(new)=R1(old) - 2R3(new)
R1(old) = 30 2 3 1 0 0
R3(new) = 3 1 1 0 0 -1
2×R3(new) = 6 2 2 0 0 -2
R1(new)=R1(old) - 2R3(new) 24 0 1 1 0 2
R2(new)=R2(old) - 3R3(new)
R2(old) = 24 3 2 0 1 0
R3(new) = 3 1 1 0 0 -1
3×R3(new) = 9 3 3 0 0 -3
R2(new)=R2(old) - 3R3(new) 15 0 -1 0 1 3
Iteration-2 Cj 6 4 0 0 0
MinRatio
B CB XB x1 x2 S1 S2 S3
XB/S3
S1 0 24 0 1 1 0 2 24/2=12
S2 0 15 0 -1 0 1 (3) 15/3=5→
x1 6 3 1 1 0 0 -1 ---
Z=18 Zj 6 6 0 0 -6
Zj-Cj 0 2 0 0 -6↑
Negative minimum Zj-Cj is -6 and its column index is 5. So, the entering variable is S3.
Minimum ratio is 5 and its row index is 2. So, the leaving basis variable is S2.
R2(new)=R2(old)÷3
R2(old) = 15 0 -1 0 1 3
R1(new)=R1(old) - 2R2(new)
R1(old) = 24 0 1 1 0 2
R3(new)=R3(old) + R2(new)
R3(old) = 3 1 1 0 0 -1
B CB XB x1 x2 S1 S2 S3 MinRatio
S1 0 14 0 1.6667 1 -0.6667 0
S3 0 5 0 -0.3333 0 0.3333 1
x1 6 8 1 0.6667 0 0.3333 0
Z=48 Zj 6 4 0 2 0
Zj-Cj 0 0 0 2 0
Max Z=48
Q8//
MAX Z = 3x1 + 5x2
subject to
x1 - 2x2 <= 6
x1 <= 10
x2 >= 1
and x1,x2 >= 0
Solution:
Problem is
Max Z = 3 x1 + 5 x2
subject to
x1 - 2 x2 ≤ 6
x1 ≤ 10
x2 ≥ 1
and x1,x2≥0;
The problem is converted to canonical form by adding slack, surplus and artificial
variables as appropiate
Iteration-1 Cj 3 5 0 0 0 -M
MinRatio
B CB XB x1 x2 S1 S2 S3 A1
XB/x2
S1 0 6 1 -2 1 0 0 0 ---
S2 0 10 1 0 0 1 0 0 ---
A1 -M 1 0 (1) 0 0 -1 1 1/1=1→
Z=-M Zj 0 -M 0 0 M -M
Zj-Cj -3 -M-5↑ 0 0 M 0
Negative minimum Zj-Cj is -M-5 and its column index is 2. So, the entering variable is x2.
Minimum ratio is 1 and its row index is 3. So, the leaving basis variable is A1.
R3(new)=R3(old)
R3(old) = 1 0 1 0 0 -1
R3(new)=R3(old) 1 0 1 0 0 -1
R1(new)=R1(old) + 2R3(new)
R1(old) = 6 1 -2 1 0 0
R3(new) = 1 0 1 0 0 -1
2×R3(new) = 2 0 2 0 0 -2
R1(new)=R1(old) + 2R3(new) 8 1 0 1 0 -2
R2(new)=R2(old)
R2(old) = 10 1 0 0 1 0
R2(new)=R2(old) 10 1 0 0 1 0
Iteration-2 Cj 3 5 0 0 0
MinRatio
B CB XB x1 x2 S1 S2 S3
XB/S3
S1 0 8 1 0 1 0 -2 ---
S2 0 10 1 0 0 1 0 ---
x2 5 1 0 1 0 0 -1 ---
Z=5 Zj 0 5 0 0 -5
Zj-Cj -3 0 0 0 -5↑
Variable S3 should enter into the basis, but all the coefficients in the S3 column are
negative or zero. So S3 can not be entered into the basis.
Q9//
MAX Z = 6x1 + 4x2
subject to
x1 + x2 <= 5
x2 >= 8
and x1,x2 >= 0
Solution:
Problem is
Max Z = 6 x1 + 4 x2
subject to
x1 + x2 ≤ 5
x2 ≥ 8
and x1,x2≥0;
The problem is converted to canonical form by adding slack, surplus and artificial
variables as appropiate
2. As the constraint-2 is of type '≥' we should subtract surplus variable S2 and add
artificial variable A1
Iteration-1 Cj 6 4 0 0 -M
MinRatio
B CB XB x1 x2 S1 S2 A1
XB/x2
S1 0 5 1 (1) 1 0 0 5/1=5→
A1 -M 8 0 1 0 -1 1 8/1=8
Z=-8M Zj 0 -M 0 M -M
Zj-Cj -6 -M-4↑ 0 M 0
Negative minimum Zj-Cj is -M-4 and its column index is 2. So, the entering variable is x2.
Minimum ratio is 5 and its row index is 1. So, the leaving basis variable is S1.
R1(new)=R1(old)
R1(old) = 5 1 1 1 0 0
R1(new)=R1(old) 5 1 1 1 0 0
R2(new)=R2(old) - R1(new)
R2(old) = 8 0 1 0 -1 1
R1(new) = 5 1 1 1 0 0
R2(new)=R2(old) - R1(new) 3 -1 0 -1 -1 1
Iteration-2 Cj 6 4 0 0 -M
B CB XB x1 x2 S1 S2 A1 MinRatio
x2 4 5 1 1 1 0 0
A1 -M 3 -1 0 -1 -1 1
Max Z=20
and the artificial variable A1 appears in the basis with positive value 3