Professional Documents
Culture Documents
Try Our New - Enter Problem or Search Problem: Learn More
Try Our New - Enter Problem or Search Problem: Learn More
NOW
PLAYING
We use cookies to improve your experience on our site and to show you relevant advertising.
By browsing this website, you agree to our use of cookies. Learn
more
Accept
Support us
I want to sell my website www.AtoZmath.com with complete code
Home > Operation Research calculators > Simplex method calculator
Algorithm and examples
Method 1. Simplex method (BigM method)
Solve the Linear programming problem using
Simplex method calculator
Type your linear programming problem
MAX Z = -2x1 - x2
subject to
3x1 + x2 = 3
x1 + 2x2 <= 4
OR
Total Variables :
2 Total Constraints : 3 Generate
Max Z = -2 x1 + -1 x2
Subject to constraints
3 x1 + 1 x2 = 3
4 x1 + 3 x2 >= 6
1 x1 + 2 x2 <= 4
Solution:
Problem is
Max Z = - 2 x 1 - x 2
subject to
3 x1 + x2 = 3
4 x1 + 3 x2 ≥ 6
x1 + 2 x2 ≤ 4
and x 1, x 2 ≥ 0;
https://cbom.atozmath.com/CBOM/Simplex.aspx?q=sm&q1=2%603%60MAX%60Z%60x1%2cx2%60-2%2c-1%603%2c1%3b4%2c3%3b1%2c2… 1/3
9/27/21, 8:21 PM Simplex method calculator
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 S 1 and add artificial variable A 2
Max Z = - 2 x 1 - x 2 + 0 S 1 + 0 S 2 - M A 1 - M A 2
subject to
3 x1 + x2 + A1 =3
4 x1 + 3 x2 - S1 + A2 = 6
x1 + 2 x2 + S2 =4
and x 1, x 2, S 1, S 2, A 1, A 2 ≥ 0
Iteration-1 Cj -2 -1 0 0 -M -M
MinRatio
CB XB x1 x2 S1 S2 A1 A2 XB
B
x1
3
A1 -M 3 (3) 1 0 0 1 0 =1→
3
6
A2 -M 6 4 3 -1 0 0 1 = 1.5
4
4
S2 0 4 1 2 0 1 0 0 =4
1
Z = - 9M Zj - 7M - 4M M 0 -M -M
Zj - Cj - 7M + 2 ↑ - 4M + 1 M 0 0 0
Negative minimum Z j - C j is - 7M + 2 and its column index is 1. So, the entering variable is x 1.
Minimum ratio is 1 and its row index is 1. So, the leaving basis variable is A 1.
+ R_1(new)= R_1(old) -: 3
Iteration-2 C_j -2 -1 0 0 -M
MinRatio
B C_B X_B x_1 x_2 S_1 S_2 A_2
(X_B)/(x_2)
Z_j-C_j 0 -1.6667M+0.3333uarr M 0 0
Negative minimum Z_j-C_j is -1.6667M+0.3333 and its column index is 2. So, the entering variable is x_2.
Minimum ratio is 1.2 and its row index is 2. So, the leaving basis variable is A_2.
https://cbom.atozmath.com/CBOM/Simplex.aspx?q=sm&q1=2%603%60MAX%60Z%60x1%2cx2%60-2%2c-1%603%2c1%3b4%2c3%3b1%2c2… 2/3
9/27/21, 8:21 PM Simplex method calculator
Iteration-3 C_j -2 -1 0 0
S_2 0 1 0 0 1 1
Z_j-C_j 0 0 0.2 0
Max Z=-2.4
Share this solution or page with your friends.
.
https://cbom.atozmath.com/CBOM/Simplex.aspx?q=sm&q1=2%603%60MAX%60Z%60x1%2cx2%60-2%2c-1%603%2c1%3b4%2c3%3b1%2c2… 3/3