[go: up one dir, main page]

0% found this document useful (0 votes)
130 views4 pages

Simplex Method Calculator CJ ZJ

Uploaded by

Kristen Aera
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
130 views4 pages

Simplex Method Calculator CJ ZJ

Uploaded by

Kristen Aera
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

10/31/22, 12:51 PM Simplex method calculator

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

Try our new - Enter problem or search problem


Home What's new College Algebra Games Feedback
Algebra Matrix & Vector Numerical Methods Statistical Methods Operation Research Word Problems Calculus

Home > Operation Research calculators > Simplex method calculator

 
Algorithm and examples
Method 2. Simplex method (BigM method)
Solve the Linear programming problem using
Simplex method calculator
Type your linear programming problem
MAX Z = 6x1 + 8x2

subject to

5x1 + 10x2 <= 100

7x1 + 7x2 <= 84

9x1 + 5x2 <= 90

and x1,x2 >= 0

OR
Total Variables :
2   Total Constraints :  3   Generate
 

Max Z= 6 x1 + 8 x2
Subject to constraints
5 x1 + 10 x2 <= 100
7 x1 + 7 x2 <= 84
9 x1 + 5 x2 <= 90

and x1,x2 >= 0 and unrestricted in sign x1, x2


Mode :
Fraction
Print Digit =
4
Calculate : Cj-Zj
Alternate Solution (if exists)
Artificial Column Remove
Subtraction Steps
Find
Random
New
 
Solution Help

Solution will be displayed step by step (In 4 parts)


Solution

Find solution using Simplex method (BigM method)


MAX Z = 6x1 + 8x2
subject to
5x1 + 10x2 <= 100
7x1 + 7x2 <= 84
9x1 + 5x2 <= 90
and x1,x2 >= 0

Solution:
Problem is
Max Z = 6 x 1 + 8 x 2
subject to
5 x 1 + 10 x 2 ≤ 100
7 x 1 + 7 x 2 ≤ 84
9 x 1 + 5 x 2 ≤ 90
and x 1, x 2 ≥ 0;

https://cbom.atozmath.com/CBOM/Simplex.aspx?q=sm&q1=2%603%60MAX%60Z%60x1%2cx2%606%2c8%605%2c10%3b7%2c7%3b9%2c5%60<%3d%2c<%… 1/4
10/31/22, 12:51 PM Simplex method calculator
The problem is converted to canonical form by adding slack, surplus and artificial variables as appropiate

1. As the constraint-1 is of type ' ≤ ' we should add slack variable S 1

2. As the constraint-2 is of type ' ≤ ' we should add slack variable S 2


3. As the constraint-3 is of type ' ≤ ' we should add slack variable S 3


After introducing slack variables


Max Z = 6 x 1 + 8 x 2 + 0 S 1 + 0 S 2 + 0 S 3
subject to
5 x 1 + 10 x 2 + S 1 = 100
x
7 1 + 7 2 x S
+ 2 = 84
9 x1 + 5 x2 + S 3 = 90
and x 1, x 2, S 1, S 2, S 3 ≥ 0

Iteration-1 Cj 6 8 0 0 0

MinRatio
CB XB x1 x2 S1 S2 S3 XB
B
x2

100
S1 0 100 5 (10) 1 0 0 = 10 →
10
84
S2 0 84 7 7 0 1 0 = 12
7
90
S3 0 90 9 5 0 0 1 = 18
5

Z=0 Zj 0 0 0 0 0

Cj - Zj 6 8↑ 0 0 0

Positive maximum C j - Z j is 8 and its column index is 2. So, the entering variable is x 2.

Minimum ratio is 10 and its row index is 1. So, the leaving basis variable is S 1.

∴ The pivot element is 10.


Entering = x 2, Departing = S 1, Key Element = 10


+ R 1(new) = R 1(old) ÷ 10

+ R 2(new) = R 2(old) - 7R 1(new)

+ R 3(new) = R 3(old) - 5R 1(new)

Iteration-2 Cj 6 8 0 0 0

MinRatio
XB

B CB XB x1 x2 S1 S2 S3
x1

10
1 1 = 20
x2 8 10 1 0 0 1
2 10
2

14
S2 0 14
()
7
2
0 -
7
10
1 0 7
2
=4→

S3 0 40 0 0 1
https://cbom.atozmath.com/CBOM/Simplex.aspx?q=sm&q1=2%603%60MAX%60Z%60x1%2cx2%606%2c8%605%2c10%3b7%2c7%3b9%2c5%60<%3d%2c<%… 2/4
10/31/22, 12:51 PM Simplex method calculator
13 1 40 80
- 13
= = 6.153
2 2 13
2

4
Z = 80 Zj 4 8 0 0
5

4
Cj - Zj 2↑ 0 - 0 0
5

Positive maximum C j - Z j is 2 and its column index is 1. So, the entering variable is x 1.

Minimum ratio is 4 and its row index is 2. So, the leaving basis variable is S 2.

7
∴ The pivot element is .
2

7
Entering = x 1, Departing = S 2, Key Element =
2

2
+ R 2(new) = R 2(old) ×
7

1
+ R 1(new) = R 1(old) - 2 R 2(new)

 
13
+ R 3(new) = R 3(old) - 2
R 2(new)

Iteration-3 Cj 6 8 0 0 0

B CB XB x1 x2 S1 S2 S3 MinRat

1 1
x2 8 8 0 1 - 0
5 7

1 2
x1 6 4 1 0 - 0
5 7

4 13
S3 0 14 0 0 - 1
5 7

2 4
Z = 88 Zj 6 8 0
5 7

2 4
Cj - Zj 0 0 - - 0
5 7

Since all C j - Z j ≤ 0

Hence, optimal solution is arrived with value of variables as :


x 1 = 4, x 2 = 8

Max Z = 88

Solution provided by AtoZmath.com


Any wrong solution, solution improvement, feedback then Submit Here

https://cbom.atozmath.com/CBOM/Simplex.aspx?q=sm&q1=2%603%60MAX%60Z%60x1%2cx2%606%2c8%605%2c10%3b7%2c7%3b9%2c5%60<%3d%2c<%… 3/4
10/31/22, 12:51 PM Simplex method calculator






Share this solution or page with your friends.

Home What's new College Algebra Games Feedback


 
Copyright © 2022. All rights reserved.
Terms,
Privacy
 
 

NOW
PLAYING

.
 . 

https://cbom.atozmath.com/CBOM/Simplex.aspx?q=sm&q1=2%603%60MAX%60Z%60x1%2cx2%606%2c8%605%2c10%3b7%2c7%3b9%2c5%60<%3d%2c<%… 4/4

You might also like