6/9/2021 Dual simplex method calculator

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
Select Language
Powered by Translate

Try our new - Enter problem or search problem

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

Ads

Home > Operation Research calculators > Dual Simplex method calculator

Algorithm and examples

Method 3. Dual simplex method
Solve the Linear programming problem using
Dual simplex method calculator
Type your linear programming problem
MAX Z = 2x1 + 2x2 + 4x3
subject to
2x1 + 3x2 + 5x3 >= 2
3x1 + x2 + 7x3 <= 3
x1 + 4x2 + 6x3 <= 5
and x1,x2,x3 >= 0

OR
Total Variables : 3 Total Constraints : 3 Generate

Max Z= 2 x1 + 2 x2 + 4 x3
Subject to constraints
2 x1 + 3 x2 + 5 x3 >= 2
3 x1 + 1 x2 + 7 x3 <= 3
1 x1 + 4 x2 + 6 x3 <= 5
and x1,x2,x3 >= 0
Mode : Fraction
Calculate : Zj-Cj
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 dual-simplex method

MAX Z = 2x1 + 2x2 + 4x3
subject to
2x1 + 3x2 + 5x3 >= 2
3x1 + x2 + 7x3 <= 3
x1 + 4x2 + 6x3 <= 5
and x1,x2,x3 >= 0

Solution:
Problem is
Max Z = 2 x 1 + 2 x 2 + 4 x 3
subject to
2 x1 + 3 x2 + 5 x3 ≥ 2
3 x1 + x2 + 7 x3 ≤ 3
x1 + 4 x2 + 6 x3 ≤ 5
and x 1, x 2, x 3 ≥ 0;

In order to apply the dual simplex method, convert all ≥ constraint to ≤ constraint by multiply -1.

Problem is
Max Z = 2 x 1 + 2 x 2 + 4 x 3
subject to
- 2 x1 - 3 x2 - 5 x3 ≤ - 2
3 x1 + x2 + 7 x3 ≤ 3
x1 + 4 x2 + 6 x3 ≤ 5
and x 1, x 2, x 3 ≥ 0;

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 = 2 x 1 + 2 x 2 + 4 x 3 + 0 S 1 + 0 S 2 + 0 S 3
subject to
- 2 x1 - 3 x2 - 5 x3 + S1 = -2
3 x1 + x2 + 7 x3 + S2 =3
x1 + 4 x2 + 6 x3 + S3 = 5
and x 1, x 2, x 3, S 1, S 2, S 3 ≥ 0

Iteration-1 Cj 2 2 4 0 0 0

B CB XB x1 x2 x3 S1 S2 S3

S1 0 -2 -2 -3 -5 1 0 0

S2 0 3 3 1 7 0 1 0

S3 0 5 1 4 6 0 0 1

Z=0 Zj 0 0 0 0 0 0

Zj - Cj -2 -2 -4 0 0 0

Ratio --- --- --- --- --- ---

(
Here not all Z j - C j ≥ 0. Because Z 1 - C 1 = - 2 )
Hence, method fails to get optimal basic feasible solution.

Solution provided by AtoZmath.com

Any wrong solution, solution improvement, feedback then Submit Here

Home What's new College Algebra Games Feedback About us

Copyright © 2021. All rights reserved. Terms, Privacy

https://cbom.atozmath.com/CBOM/Simplex.aspx?q=ds&q1=3%603%60MAX%60Z%60x1%2cx2%2cx3%602%2c2%2c4%602%2c3%2c5%3b3%2c1%2c7%3b1%2c4%2c6%60>%3d%2c<%3d%2c<%3d%602%2c3%2c5%60%60F%60false%60true%60true%60true%60false%60false%60true&do=1#PrevPart 1/2