Scribd
Upload
61 views6 pages

Dual Simplex

The document describes the dual simplex method, which is used when the optimal solution from the standard simplex method is infeasible. It involves converting the problem into canonical form, then preparing the standard linear programming tableau. The algorithm finds the most negative basic variable at each iteration and calculates the minimum ratio to determine which variable should enter the basis. The example problem is run through three iterations of the dual simplex method before reaching an optimal feasible solution.

Uploaded by

Raj Einstein
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
61 views6 pages

Dual Simplex

The document describes the dual simplex method, which is used when the optimal solution from the standard simplex method is infeasible. It involves converting the problem into canonical form, then preparing the standard linear programming tableau. The algorithm finds the most negative basic variable at each iteration and calculates the minimum ratio to determine which variable should enter the basis. The example problem is run through three iterations of the dual simplex method before reaching an optimal feasible solution.

Uploaded by

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

DUAL SIMPLEX METHOD [25 MINS]

WHEN TO USE: WHEN WE HAVE AN OPTIMAL SOLUTION WHICH IS INFEASIBLE


WHAT IS THIS: AN ANOTHER FORM OF SIMPLEX METHOD
HOW:?

EXAMPLE:
MIN: 3X1+X2

X1+X1>=1
2X1+3X2>=2

X1, X2>=0

STEP 1: CONVERT THIS PROBLEM INTO CANONICAL FORM

MAX -3X1-X2
ST
-X1-X2 <=-1
-2X1-3X2 <=-2

STEP 2: PREPARE THE STANDARD LLP


MAX Z=-3X1-X2+0S1+0S2
ST
-X1-X2 + S1 =-1
-2X1-3X2 + S2 =-2

ITERATION 0 BASIC
Z
S1
S2

ITERATION 1 FIND THE MOST NEGATIVE BASIC


CHOOSE THE ROW: r

FIND MINIMUM RATIO IN r


BASIC
Z
S1
X2

ITERATION 2 FIND THE MOST NEGATIVE BASIC


CHOOSE THE ROW: r

FIND MINIMUM RATIO IN r

BASIC
Z
S2
X2

Iteration3 FIND THE MOST NEGATIVE BASIC


BOOK PAGE NO 174
OPTIMILITY FEASIBILITY
SOLUTION WHICH IS INFEASIBLE
EX METHOD

NICAL FORM

Z X1 X2 S1 S2 SOL
1 3 1 0 0 0
0 -1 -1 1 0 -1
0 -2 -3 0 1 -2

FIND THE MOST NEGATIVE BASIC VARIABLE. HOWEVER IF ALL THE VARIABLES ARE NON-NEGATIVE THE ALGORITHMS ENDS
CHOOSE THE ROW: r

FIND MINIMUM RATIO IN r


|CZj/Arj| , IF Arj<0

3/2 1/3
Z X1 X2 S1 S2 SOL
1 7/3 0 0 1/3 -2/3
0 -1/3 0 1 -1/3 -1/3
0 2/3 1 0 -1/3 2/3

FIND THE MOST NEGATIVE BASIC VARIABLE. HOWEVER IF ALL THE VARIABLES ARE NON-NEGATIVE THE ALGORITHMS ENDS
CHOOSE THE ROW: r

FIND MINIMUM RATIO IN r


|CZj/Arj| , IF Arj<0

7 1

Z X1 X2 S1 S2 SOL
1 2 0 1 0 -1
0 1 0 -3 1 1
0 1 1 -1 0 1

FIND THE MOST NEGATIVE BASIC VARIABLE. HOWEVER IF ALL THE VARIABLES ARE NON-NEGATIVE THE ALGORITHMS ENDS

Z=-1 S2=X2=1
Z=1 S1=X1=0
FEASIBILITY

HE ALGORITHMS ENDS
HE ALGORITHMS ENDS

HE ALGORITHMS ENDS

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy