SlideShare a Scribd company logo
1 of 33
Download to read offline
D Nagesh Kumar, IISc Optimization Methods: M3L51
Linear Programming
Revised Simplex Method,
Duality of LP problems
and Sensitivity analysis
D Nagesh Kumar, IISc Optimization Methods: M3L52
Introduction
Revised simplex method is an improvement over simplex method. It is
computationally more efficient and accurate.
Duality of LP problem is a useful property that makes the problem
easier in some cases
Dual simplex method is computationally similar to simplex method.
However, their approaches are different from each other.
Primal-Dual relationship is also helpful in sensitivity or post optimality
analysis of decision variables.
D Nagesh Kumar, IISc Optimization Methods: M3L53
Objectives
Objectives
To explain revised simplex method
To discuss about duality of LP and Primal-Dual relationship
To illustrate dual simplex method
To end with sensitivity or post optimality analysis
D Nagesh Kumar, IISc Optimization Methods: M3L54
Revised Simplex method: Introduction
Benefit of revised simplex method is clearly
comprehended in case of large LP problems.
In simplex method the entire simplex tableau is
updated while a small part of it is used.
The revised simplex method uses exactly the same
steps as those in simplex method.
The only difference occurs in the details of computing
the entering variables and departing variable.
D Nagesh Kumar, IISc Optimization Methods: M3L55
Revised Simplex method
Consider the following LP problem (with general notations, after
transforming it to its standard form and incorporating all required slack,
surplus and artificial variables)
( )
( )
( )
( )
1 1 2 2 3 3
11 1 12 2 13 3 1 1
21 1 22 2 23 3 2 2
1 1 2 2 3 3
0n n
i n n
j n n
l m m m mn n m
Z c x c x c x c x Z
x c x c x c x c x b
x c x c x c x c x b
x c x c x c x c x b
+ + + + + =
+ + + + =
+ + + + =
+ + + + =
LLL
LLL
LLL
M M M
M M M
LLL
As the revised simplex method is mostly beneficial for large LP
problems, it will be discussed in the context of matrix notation.
D Nagesh Kumar, IISc Optimization Methods: M3L56
Revised Simplex method: Matrix form
Matrix notation
:with
:subject to
zMinimize T
0X
BAX
XC
≥
=
=
⎥
⎥
⎥
⎥
⎦
⎤
⎢
⎢
⎢
⎢
⎣
⎡
=
nx
x
x
M
2
1
X
⎥
⎥
⎥
⎥
⎦
⎤
⎢
⎢
⎢
⎢
⎣
⎡
=
nc
c
c
M
2
1
C
1
2
m
b
b
b
⎡ ⎤
⎢ ⎥
⎢ ⎥
⎢ ⎥=
⎢ ⎥
⎢ ⎥
⎢ ⎥⎣ ⎦
B
M
⎥
⎥
⎥
⎥
⎦
⎤
⎢
⎢
⎢
⎢
⎣
⎡
=
0
0
0
M
0
⎥
⎥
⎥
⎥
⎦
⎤
⎢
⎢
⎢
⎢
⎣
⎡
=
mnmm
n
n
ccc
ccc
ccc
L
MOMM
L
L
21
22221
11211
A
where
D Nagesh Kumar, IISc Optimization Methods: M3L57
Revised Simplex method: Notations
Notations for subsequent discussions:
Column vector corresponding to a decision variable is .
is the column vector of basic variables
is the row vector of cost coefficients corresponding to ,
and
is the basis matrix corresponding to
SX
SX
SC
S
SX
kx
⎥
⎥
⎥
⎥
⎦
⎤
⎢
⎢
⎢
⎢
⎣
⎡
mk
k
k
c
c
c
M
2
1
D Nagesh Kumar, IISc Optimization Methods: M3L58
Revised Simplex method:
Iterative steps
1. Selection of entering variable
For each of the nonbasic variables, calculate the coefficient
(WP - c), where, P is the corresponding column vector
associated with the nonbasic variable at hand, c is the cost
coefficient associated with that nonbasic variable and W =
CS S -1
.
For maximization (minimization) problem, nonbasic
variable, having the lowest negative (highest positive)
coefficient, as calculated above, is the entering variable.
D Nagesh Kumar, IISc Optimization Methods: M3L59
Revised Simplex method:
Iterative steps
2. Selection of departing variable
a) A new column vector U is calculated as U = S-1
B
b) Corresponding to the entering variable, another vector V is
calculated as V = S-1
P, where P is the column vector
corresponding to entering variable.
c) It may be noted that length of both U and V is same (= m). For
i = 1,…, m, the ratios, U(i)/V(i), are calculated provided V(i) > 0.
i = r , for which the ratio is least, is noted. The r th basic
variable of the current basis is the departing variable.
If it is found that V(i) < 0 for all i, then further calculation is stopped
concluding that bounded solution does not exist for the LP problem at
hand.
D Nagesh Kumar, IISc Optimization Methods: M3L510
Revised Simplex method:
Iterative steps
3. Update to new Basis
Old basis S, is updated to new basis Snew, as Snew = [ E S-1
] -1
where
( )
( )
( )⎪
⎪
⎩
⎪⎪
⎨
⎧
=
≠
=
ri
rV
ri
rV
iV
i
for
1
for
ηand
r thcolumn
1
2
1
1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
r
m
m
η
η
η
η
η
−
⎡ ⎤
⎢ ⎥
⎢ ⎥
⎢ ⎥
⎢ ⎥
⎢ ⎥
⎢ ⎥=
⎢ ⎥
⎢ ⎥
⎢ ⎥
⎢ ⎥
⎢ ⎥
⎢ ⎥
⎣ ⎦
E
L L
L L
M M O M L M M
M M L L M M
M M L M O M M
L L
L L
D Nagesh Kumar, IISc Optimization Methods: M3L511
Revised Simplex method:
Iterative steps
S is replaced by Snew and steps1 through 3 are repeated.
If all the coefficients calculated in step 1, i.e., is positive (negative)
in case of maximization (minimization) problem, then optimum
solution is reached
The optimal solution is
XS=S-1B and z = CXS
D Nagesh Kumar, IISc Optimization Methods: M3L512
Duality of LP problems
Each LP problem (called as Primal in this context) is
associated with its counterpart known as Dual LP problem.
Instead of primal, solving the dual LP problem is sometimes
easier in following cases
a) The dual has fewer constraints than primal
Time required for solving LP problems is directly affected by the
number of constraints, i.e., number of iterations necessary to
converge to an optimum solution, which in Simplex method
usually ranges from 1.5 to 3 times the number of structural
constraints in the problem
b) The dual involves maximization of an objective function
It may be possible to avoid artificial variables that otherwise would
be used in a primal minimization problem.
D Nagesh Kumar, IISc Optimization Methods: M3L513
Finding Dual of a LP problem
Inequality sign of ith Constraint:
if dual is maximization
if dual is minimization
xi > 0
jth variablejth constraint
ith constraintith variable
MaximizationMinimization
MinimizationMaximization
DualPrimal
≥
≤
…contd. to next slide
D Nagesh Kumar, IISc Optimization Methods: M3L514
Finding Dual of a LP problem…contd.
RHS of ith constraint constraints
Cost coefficient associated with
ith variable in the objective
function
Cost coefficient associated with jth
variable in the objective function
RHS of jth constraint
jth variable unrestrictedjth constraint with = sign
ith constraint with = signith variable unrestricted
DualPrimal
Refer class notes for pictorial representation of all the operations
D Nagesh Kumar, IISc Optimization Methods: M3L515
Dual from a Primal
D Nagesh Kumar, IISc Optimization Methods: M3L516
Finding Dual of a LP problem…contd.
Note:
Before finding its dual, all the constraints should be
transformed to ‘less-than-equal-to’ or ‘equal-to’ type for
maximization problem and to ‘greater-than-equal-to’ or
‘equal-to’ type for minimization problem.
It can be done by multiplying with -1 both sides of the
constraints, so that inequality sign gets reversed.
D Nagesh Kumar, IISc Optimization Methods: M3L517
Finding Dual of a LP problem:
An example
Primal Dual
Maximize Minimize
Subject to Subject to
6000
3
2
21 ≤+ xx
200021 ≥− xx
40001 ≤x
3
3
2
21 ≤+ yy
4321 =+− yyy
1 unrestrictedx
02 ≥x
01 ≥y
02 ≥y
21 34 xxZ += 321 400020006000 yyyZ +−=′
Note: Second constraint in the primal is transformed to
before constructing the dual.
1 2 2000x x− + ≤ −
03 ≥y
D Nagesh Kumar, IISc Optimization Methods: M3L518
Primal-Dual relationships
If one problem (either primal or dual) has an optimal
feasible solution, other problem also has an optimal
feasible solution. The optimal objective function
value is same for both primal and dual.
If one problem has no solution (infeasible), the other
problem is either infeasible or unbounded.
If one problem is unbounded the other problem is
infeasible.
D Nagesh Kumar, IISc Optimization Methods: M3L519
Dual Simplex Method
Simplex Method verses Dual Simplex Method
1. Simplex method starts with a nonoptimal but
feasible solution where as dual simplex method
starts with an optimal but infeasible solution.
2. Simplex method maintains the feasibility during
successive iterations where as dual simplex
method maintains the optimality.
D Nagesh Kumar, IISc Optimization Methods: M3L520
Dual Simplex Method: Iterative steps
Steps involved in the dual simplex method are:
1. All the constraints (except those with equality (=) sign) are
modified to ‘less-than-equal-to’ sign. Constraints with
greater-than-equal-to’ sign are multiplied by -1 through out
so that inequality sign gets reversed. Finally, all these
constraints are transformed to equality sign by introducing
required slack variables.
2. Modified problem, as in step one, is expressed in the form
of a simplex tableau. If all the cost coefficients are positive
(i.e., optimality condition is satisfied) and one or more
basic variables have negative values (i.e., non-feasible
solution), then dual simplex method is applicable.
D Nagesh Kumar, IISc Optimization Methods: M3L521
Dual Simplex Method: Iterative
steps…contd.
3. Selection of exiting variable: The basic variable with the
highest negative value is the exiting variable. If there are two
candidates for exiting variable, any one is selected. The row
of the selected exiting variable is marked as pivotal row.
4. Selection of entering variable: Cost coefficients,
corresponding to all the negative elements of the pivotal row,
are identified. Their ratios are calculated after changing the
sign of the elements of pivotal row, i.e.,
The column corresponding to minimum ratio is identified as
the pivotal column and associated decision variable is the
entering variable.
⎟⎟
⎠
⎞
⎜⎜
⎝
⎛
×−
=
rowpivotalofElements
tsCoefficienCost
ratio
1
D Nagesh Kumar, IISc Optimization Methods: M3L522
Dual Simplex Method: Iterative
steps…contd.
5. Pivotal operation: Pivotal operation is exactly
same as in the case of simplex method,
considering the pivotal element as the element at
the intersection of pivotal row and pivotal column.
6. Check for optimality: If all the basic variables
have nonnegative values then the optimum solution
is reached. Otherwise, Steps 3 to 5 are repeated
until the optimum is reached.
D Nagesh Kumar, IISc Optimization Methods: M3L523
Dual Simplex Method:
An Example
Consider the following problem:
12
1234
2443
2tosubject
2Minimize
21
21
21
1
21
≥+−
≥+
≤+
≥
+=
xx
xx
xx
x
xxZ
D Nagesh Kumar, IISc Optimization Methods: M3L524
Dual Simplex Method:
An Example…contd.
After introducing the surplus variables the problem is reformulated
with equality constraints as follows:
12
1234
2443
2tosubject
2Minimize
621
521
421
31
21
−=+−
−=+−−
=++
−=+−
+=
xxx
xxx
xxx
xx
xxZ
D Nagesh Kumar, IISc Optimization Methods: M3L525
Dual Simplex Method:
An Example…contd.
Expressing the problem in the tableau form:
D Nagesh Kumar, IISc Optimization Methods: M3L526
Dual Simplex Method:
An Example…contd.
Successive iterations:
D Nagesh Kumar, IISc Optimization Methods: M3L527
Dual Simplex Method:
An Example…contd.
Successive iterations:
D Nagesh Kumar, IISc Optimization Methods: M3L528
Dual Simplex Method:
An Example…contd.
Successive iterations:
As all the br are positive, optimum solution is reached.
Thus, the optimal solution is Z = 5.5 with x1 = 2 and x2 = 1.5
D Nagesh Kumar, IISc Optimization Methods: M3L529
Solution of Dual from Primal Simplex
0,,
2222
124
452tosubject
406'Minimize
321
321
321
321
321
≥
≥−+
−≥−−
≥++
++=
yyy
yyy
yyy
yyy
yyyZ
Primal
Dual
0,,
4225
024
622tosubject
24Maximize
321
321
321
321
321
≥
≤−−
≤+−
≤++
+−=
xxx
xxx
xxx
xxx
xxxZ y1
y2
y3
Z’
D Nagesh Kumar, IISc Optimization Methods: M3L530
Sensitivity or post optimality analysis
• Changes that can affect only Optimality
• Change in coefficients of the objective function, C1, C2,..
• Re-solve the problem to obtain the solution
• Changes that can affect only Feasibility
• Change in right hand side values, b1, b2,..
• Apply dual simplex method or study the dual variable values
• Changes that can affect both Optimality and Feasibility
• Simultaneous change in C1, C2,.. and b1, b2,..
• Use both primal simplex and dual simplex or re-solve
D Nagesh Kumar, IISc Optimization Methods: M3L531
Sensitivity or post optimality analysis
A dual variable, associated with a constraint, indicates
a change in Z value (optimum) for a small change in
RHS of that constraint.
j iZ y bΔ = Δ
where yj is the dual variable associated with the ith constraint,
Δbi is the small change in the RHS of ith constraint,
ΔZ is the change in objective function owing to Δbi.
D Nagesh Kumar, IISc Optimization Methods: M3L532
Sensitivity or post optimality analysis:
An Example
Let, for a LP problem, ith constraint be
and the optimum value of the objective function be 250.
RHS of the ith constraint changes to 55, i.e., ith constraint changes
to
Let, dual variable associated with the ith constraint is yj , optimum
value of which is 2.5 (say). Thus, Δbi = 55 – 50 = 5 and yj = 2.5
So, ΔZ = yj Δbi = 2.5x5 = 12.5 and revised optimum value of the
objective function is 250 + 12.5 = 262.5.
1 22 50x x+ ≤
1 22 55x x+ ≤
D Nagesh Kumar, IISc Optimization Methods: M3L533
Thank You

More Related Content

What's hot

primal and dual problem
primal and dual problemprimal and dual problem
primal and dual problemYash Lad
 
LINEAR PROGRAMMING Assignment help
LINEAR PROGRAMMING Assignment helpLINEAR PROGRAMMING Assignment help
LINEAR PROGRAMMING Assignment helpjohn mayer
 
Solving linear programming model by simplex method
Solving linear programming model by simplex methodSolving linear programming model by simplex method
Solving linear programming model by simplex methodRoshan Kumar Patel
 
Sensitivity analysis linear programming copy
Sensitivity analysis linear programming   copySensitivity analysis linear programming   copy
Sensitivity analysis linear programming copyKiran Jadhav
 
Simplex method: Slack, Surplus & Artificial variable
Simplex method:  Slack, Surplus & Artificial variableSimplex method:  Slack, Surplus & Artificial variable
Simplex method: Slack, Surplus & Artificial variableDevyaneeDevyanee2007
 
Dynamic programming class 16
Dynamic programming class 16Dynamic programming class 16
Dynamic programming class 16Kumar
 
Simplex Method
Simplex MethodSimplex Method
Simplex MethodSachin MK
 
Simplex method concept,
Simplex method concept,Simplex method concept,
Simplex method concept,Dronak Sahu
 

What's hot (20)

primal and dual problem
primal and dual problemprimal and dual problem
primal and dual problem
 
LINEAR PROGRAMMING Assignment help
LINEAR PROGRAMMING Assignment helpLINEAR PROGRAMMING Assignment help
LINEAR PROGRAMMING Assignment help
 
PRIMAL & DUAL PROBLEMS
PRIMAL & DUAL PROBLEMSPRIMAL & DUAL PROBLEMS
PRIMAL & DUAL PROBLEMS
 
Solving linear programming model by simplex method
Solving linear programming model by simplex methodSolving linear programming model by simplex method
Solving linear programming model by simplex method
 
Concept of Duality
Concept of DualityConcept of Duality
Concept of Duality
 
Unit.2. linear programming
Unit.2. linear programmingUnit.2. linear programming
Unit.2. linear programming
 
CONVERGENCE.ppt
CONVERGENCE.pptCONVERGENCE.ppt
CONVERGENCE.ppt
 
Two phase method lpp
Two phase method lppTwo phase method lpp
Two phase method lpp
 
Linear programing
Linear programingLinear programing
Linear programing
 
Linear Programming
Linear ProgrammingLinear Programming
Linear Programming
 
Sensitivity analysis linear programming copy
Sensitivity analysis linear programming   copySensitivity analysis linear programming   copy
Sensitivity analysis linear programming copy
 
Big-M Method Presentation
Big-M Method PresentationBig-M Method Presentation
Big-M Method Presentation
 
Simplex method: Slack, Surplus & Artificial variable
Simplex method:  Slack, Surplus & Artificial variableSimplex method:  Slack, Surplus & Artificial variable
Simplex method: Slack, Surplus & Artificial variable
 
graphical method
graphical method graphical method
graphical method
 
Dynamic programming class 16
Dynamic programming class 16Dynamic programming class 16
Dynamic programming class 16
 
Operations Research - The Dual Simplex Method
Operations Research - The Dual Simplex MethodOperations Research - The Dual Simplex Method
Operations Research - The Dual Simplex Method
 
Simplex Method
Simplex MethodSimplex Method
Simplex Method
 
Simplex method concept,
Simplex method concept,Simplex method concept,
Simplex method concept,
 
Separation of variables
Separation of variablesSeparation of variables
Separation of variables
 
Linear Programming
Linear  ProgrammingLinear  Programming
Linear Programming
 

Viewers also liked

Duality in Linear Programming
Duality in Linear ProgrammingDuality in Linear Programming
Duality in Linear Programmingjyothimonc
 
Special Cases in Simplex Method
Special Cases in Simplex MethodSpecial Cases in Simplex Method
Special Cases in Simplex MethodDivyansh Verma
 
Operation Research (Simplex Method)
Operation Research (Simplex Method)Operation Research (Simplex Method)
Operation Research (Simplex Method)Shivani Gautam
 
Numerical analysis simplex method 2
Numerical analysis  simplex method 2Numerical analysis  simplex method 2
Numerical analysis simplex method 2SHAMJITH KM
 
Duality in Linear Programming Problem
Duality in Linear Programming ProblemDuality in Linear Programming Problem
Duality in Linear Programming ProblemRAVI PRASAD K.J.
 
Taylor introms10 ppt_03
Taylor introms10 ppt_03Taylor introms10 ppt_03
Taylor introms10 ppt_03QA Cmu
 
Duality in lpp
Duality in lppDuality in lpp
Duality in lppAbu Bashar
 
Simplex method Big M infeasible
Simplex method Big M infeasibleSimplex method Big M infeasible
Simplex method Big M infeasibleIzzati Hamid
 
Linear programming using the simplex method
Linear programming using the simplex methodLinear programming using the simplex method
Linear programming using the simplex methodShivek Khurana
 
Simplex method - Maximisation Case
Simplex method - Maximisation CaseSimplex method - Maximisation Case
Simplex method - Maximisation CaseJoseph Konnully
 
LINEAR PROGRAMMING
LINEAR PROGRAMMINGLINEAR PROGRAMMING
LINEAR PROGRAMMINGrashi9
 
Applications of linear programming
Applications of linear programmingApplications of linear programming
Applications of linear programmingZenblade 93
 
Linear programming - Model formulation, Graphical Method
Linear programming  - Model formulation, Graphical MethodLinear programming  - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical MethodJoseph Konnully
 
Implémentation de l’algorithme du Simplexe En Java
Implémentation de l’algorithme du Simplexe En JavaImplémentation de l’algorithme du Simplexe En Java
Implémentation de l’algorithme du Simplexe En JavaRached Krim
 

Viewers also liked (20)

Duality in Linear Programming
Duality in Linear ProgrammingDuality in Linear Programming
Duality in Linear Programming
 
Special Cases in Simplex Method
Special Cases in Simplex MethodSpecial Cases in Simplex Method
Special Cases in Simplex Method
 
Operation Research (Simplex Method)
Operation Research (Simplex Method)Operation Research (Simplex Method)
Operation Research (Simplex Method)
 
5. advance topics in lp
5. advance topics in lp5. advance topics in lp
5. advance topics in lp
 
Numerical analysis simplex method 2
Numerical analysis  simplex method 2Numerical analysis  simplex method 2
Numerical analysis simplex method 2
 
Duality in Linear Programming Problem
Duality in Linear Programming ProblemDuality in Linear Programming Problem
Duality in Linear Programming Problem
 
Taylor introms10 ppt_03
Taylor introms10 ppt_03Taylor introms10 ppt_03
Taylor introms10 ppt_03
 
Operations research 1_the_two-phase_simp
Operations research 1_the_two-phase_simpOperations research 1_the_two-phase_simp
Operations research 1_the_two-phase_simp
 
Duality in lpp
Duality in lppDuality in lpp
Duality in lpp
 
Simplex method Big M infeasible
Simplex method Big M infeasibleSimplex method Big M infeasible
Simplex method Big M infeasible
 
Lp simplex 3_
Lp simplex 3_Lp simplex 3_
Lp simplex 3_
 
Big m method
Big m methodBig m method
Big m method
 
Linear programming
Linear programmingLinear programming
Linear programming
 
Linear programming using the simplex method
Linear programming using the simplex methodLinear programming using the simplex method
Linear programming using the simplex method
 
Simplex method - Maximisation Case
Simplex method - Maximisation CaseSimplex method - Maximisation Case
Simplex method - Maximisation Case
 
LINEAR PROGRAMMING
LINEAR PROGRAMMINGLINEAR PROGRAMMING
LINEAR PROGRAMMING
 
Applications of linear programming
Applications of linear programmingApplications of linear programming
Applications of linear programming
 
Linear programming - Model formulation, Graphical Method
Linear programming  - Model formulation, Graphical MethodLinear programming  - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical Method
 
Implémentation de l’algorithme du Simplexe En Java
Implémentation de l’algorithme du Simplexe En JavaImplémentation de l’algorithme du Simplexe En Java
Implémentation de l’algorithme du Simplexe En Java
 
Simplex two phase
Simplex two phaseSimplex two phase
Simplex two phase
 

Similar to Numerical analysis dual, primal, revised simplex

M3L4.ppt
M3L4.pptM3L4.ppt
M3L4.pptRufesh
 
Numerical analysis simplex method 1
Numerical analysis  simplex method 1Numerical analysis  simplex method 1
Numerical analysis simplex method 1SHAMJITH KM
 
Simplex method material for operation .pptx
Simplex method material for operation .pptxSimplex method material for operation .pptx
Simplex method material for operation .pptxbizuayehuadmasu1
 
Alternative Approach To The Optimum Solution Of Linear Programming Problem
Alternative Approach To The Optimum Solution Of Linear Programming ProblemAlternative Approach To The Optimum Solution Of Linear Programming Problem
Alternative Approach To The Optimum Solution Of Linear Programming ProblemMartha Brown
 
Unit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisisUnit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisisDagnaygebawGoshme
 
A Proposed Method For Solving Quasi-Concave Quadratic Programming Problems By...
A Proposed Method For Solving Quasi-Concave Quadratic Programming Problems By...A Proposed Method For Solving Quasi-Concave Quadratic Programming Problems By...
A Proposed Method For Solving Quasi-Concave Quadratic Programming Problems By...Finni Rice
 
LPP, Duality and Game Theory
LPP, Duality and Game TheoryLPP, Duality and Game Theory
LPP, Duality and Game TheoryPurnima Pandit
 
Numerical analysis canonical
Numerical analysis  canonicalNumerical analysis  canonical
Numerical analysis canonicalSHAMJITH KM
 
SIMPLEX METHOD.pptx
SIMPLEX METHOD.pptxSIMPLEX METHOD.pptx
SIMPLEX METHOD.pptxTista3
 
LP linear programming (summary) (5s)
LP linear programming (summary) (5s)LP linear programming (summary) (5s)
LP linear programming (summary) (5s)Dionísio Carmo-Neto
 
Unsteady MHD Flow Past A Semi-Infinite Vertical Plate With Heat Source/ Sink:...
Unsteady MHD Flow Past A Semi-Infinite Vertical Plate With Heat Source/ Sink:...Unsteady MHD Flow Past A Semi-Infinite Vertical Plate With Heat Source/ Sink:...
Unsteady MHD Flow Past A Semi-Infinite Vertical Plate With Heat Source/ Sink:...IJERA Editor
 
Linear programming class 12 investigatory project
Linear programming class 12 investigatory projectLinear programming class 12 investigatory project
Linear programming class 12 investigatory projectDivyans890
 
A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona...
A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona...A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona...
A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona...MangaiK4
 
Non-Linear Fractional Programming Problems
Non-Linear Fractional Programming ProblemsNon-Linear Fractional Programming Problems
Non-Linear Fractional Programming ProblemsMangaiK4
 
Balaji-opt-lecture3-sp13.pptx
Balaji-opt-lecture3-sp13.pptxBalaji-opt-lecture3-sp13.pptx
Balaji-opt-lecture3-sp13.pptxMayurkumarpatil1
 
Dynamic programming prasintation eaisy
Dynamic programming prasintation eaisyDynamic programming prasintation eaisy
Dynamic programming prasintation eaisyahmed51236
 
Artificial Variable Technique –
Artificial Variable Technique –Artificial Variable Technique –
Artificial Variable Technique –itsvineeth209
 

Similar to Numerical analysis dual, primal, revised simplex (20)

M3L4.ppt
M3L4.pptM3L4.ppt
M3L4.ppt
 
Numerical analysis simplex method 1
Numerical analysis  simplex method 1Numerical analysis  simplex method 1
Numerical analysis simplex method 1
 
Simplex method material for operation .pptx
Simplex method material for operation .pptxSimplex method material for operation .pptx
Simplex method material for operation .pptx
 
Simplex method
Simplex method Simplex method
Simplex method
 
Alternative Approach To The Optimum Solution Of Linear Programming Problem
Alternative Approach To The Optimum Solution Of Linear Programming ProblemAlternative Approach To The Optimum Solution Of Linear Programming Problem
Alternative Approach To The Optimum Solution Of Linear Programming Problem
 
Simplex method
Simplex methodSimplex method
Simplex method
 
Unit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisisUnit.3. duality and sensetivity analisis
Unit.3. duality and sensetivity analisis
 
A Proposed Method For Solving Quasi-Concave Quadratic Programming Problems By...
A Proposed Method For Solving Quasi-Concave Quadratic Programming Problems By...A Proposed Method For Solving Quasi-Concave Quadratic Programming Problems By...
A Proposed Method For Solving Quasi-Concave Quadratic Programming Problems By...
 
LPP, Duality and Game Theory
LPP, Duality and Game TheoryLPP, Duality and Game Theory
LPP, Duality and Game Theory
 
Numerical analysis canonical
Numerical analysis  canonicalNumerical analysis  canonical
Numerical analysis canonical
 
SIMPLEX METHOD.pptx
SIMPLEX METHOD.pptxSIMPLEX METHOD.pptx
SIMPLEX METHOD.pptx
 
LP linear programming (summary) (5s)
LP linear programming (summary) (5s)LP linear programming (summary) (5s)
LP linear programming (summary) (5s)
 
Unsteady MHD Flow Past A Semi-Infinite Vertical Plate With Heat Source/ Sink:...
Unsteady MHD Flow Past A Semi-Infinite Vertical Plate With Heat Source/ Sink:...Unsteady MHD Flow Past A Semi-Infinite Vertical Plate With Heat Source/ Sink:...
Unsteady MHD Flow Past A Semi-Infinite Vertical Plate With Heat Source/ Sink:...
 
Linear programming class 12 investigatory project
Linear programming class 12 investigatory projectLinear programming class 12 investigatory project
Linear programming class 12 investigatory project
 
1 s2.0-0378381289800731-main
1 s2.0-0378381289800731-main1 s2.0-0378381289800731-main
1 s2.0-0378381289800731-main
 
A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona...
A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona...A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona...
A New Computer Oriented Technique to Solve Sum of Ration Non-Linear Fractiona...
 
Non-Linear Fractional Programming Problems
Non-Linear Fractional Programming ProblemsNon-Linear Fractional Programming Problems
Non-Linear Fractional Programming Problems
 
Balaji-opt-lecture3-sp13.pptx
Balaji-opt-lecture3-sp13.pptxBalaji-opt-lecture3-sp13.pptx
Balaji-opt-lecture3-sp13.pptx
 
Dynamic programming prasintation eaisy
Dynamic programming prasintation eaisyDynamic programming prasintation eaisy
Dynamic programming prasintation eaisy
 
Artificial Variable Technique –
Artificial Variable Technique –Artificial Variable Technique –
Artificial Variable Technique –
 

More from SHAMJITH KM

Salah of the Prophet (ﷺ).pdf
Salah of the Prophet (ﷺ).pdfSalah of the Prophet (ﷺ).pdf
Salah of the Prophet (ﷺ).pdfSHAMJITH KM
 
Construction Materials and Engineering - Module IV - Lecture Notes
Construction Materials and Engineering - Module IV - Lecture NotesConstruction Materials and Engineering - Module IV - Lecture Notes
Construction Materials and Engineering - Module IV - Lecture NotesSHAMJITH KM
 
Construction Materials and Engineering - Module III - Lecture Notes
Construction Materials and Engineering - Module III - Lecture NotesConstruction Materials and Engineering - Module III - Lecture Notes
Construction Materials and Engineering - Module III - Lecture NotesSHAMJITH KM
 
Construction Materials and Engineering - Module II - Lecture Notes
Construction Materials and Engineering - Module II - Lecture NotesConstruction Materials and Engineering - Module II - Lecture Notes
Construction Materials and Engineering - Module II - Lecture NotesSHAMJITH KM
 
Construction Materials and Engineering - Module I - Lecture Notes
Construction Materials and Engineering - Module I - Lecture NotesConstruction Materials and Engineering - Module I - Lecture Notes
Construction Materials and Engineering - Module I - Lecture NotesSHAMJITH KM
 
Computing fundamentals lab record - Polytechnics
Computing fundamentals lab record - PolytechnicsComputing fundamentals lab record - Polytechnics
Computing fundamentals lab record - PolytechnicsSHAMJITH KM
 
Concrete lab manual - Polytechnics
Concrete lab manual - PolytechnicsConcrete lab manual - Polytechnics
Concrete lab manual - PolytechnicsSHAMJITH KM
 
Concrete Technology Study Notes
Concrete Technology Study NotesConcrete Technology Study Notes
Concrete Technology Study NotesSHAMJITH KM
 
നബി(സ)യുടെ നമസ്കാരം - രൂപവും പ്രാര്ത്ഥനകളും
നബി(സ)യുടെ നമസ്കാരം -  രൂപവും പ്രാര്ത്ഥനകളുംനബി(സ)യുടെ നമസ്കാരം -  രൂപവും പ്രാര്ത്ഥനകളും
നബി(സ)യുടെ നമസ്കാരം - രൂപവും പ്രാര്ത്ഥനകളുംSHAMJITH KM
 
Design of simple beam using staad pro - doc file
Design of simple beam using staad pro - doc fileDesign of simple beam using staad pro - doc file
Design of simple beam using staad pro - doc fileSHAMJITH KM
 
Design of simple beam using staad pro
Design of simple beam using staad proDesign of simple beam using staad pro
Design of simple beam using staad proSHAMJITH KM
 
Python programs - PPT file (Polytechnics)
Python programs - PPT file (Polytechnics)Python programs - PPT file (Polytechnics)
Python programs - PPT file (Polytechnics)SHAMJITH KM
 
Python programs - first semester computer lab manual (polytechnics)
Python programs - first semester computer lab manual (polytechnics)Python programs - first semester computer lab manual (polytechnics)
Python programs - first semester computer lab manual (polytechnics)SHAMJITH KM
 
Python programming Workshop SITTTR - Kalamassery
Python programming Workshop SITTTR - KalamasseryPython programming Workshop SITTTR - Kalamassery
Python programming Workshop SITTTR - KalamasserySHAMJITH KM
 
Analysis of simple beam using STAAD Pro (Exp No 1)
Analysis of simple beam using STAAD Pro (Exp No 1)Analysis of simple beam using STAAD Pro (Exp No 1)
Analysis of simple beam using STAAD Pro (Exp No 1)SHAMJITH KM
 
Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)SHAMJITH KM
 
Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)SHAMJITH KM
 
CAD Lab model viva questions
CAD Lab model viva questions CAD Lab model viva questions
CAD Lab model viva questions SHAMJITH KM
 
Brain Computer Interface (BCI) - seminar PPT
Brain Computer Interface (BCI) -  seminar PPTBrain Computer Interface (BCI) -  seminar PPT
Brain Computer Interface (BCI) - seminar PPTSHAMJITH KM
 
Surveying - Module iii-levelling only note
Surveying - Module  iii-levelling only noteSurveying - Module  iii-levelling only note
Surveying - Module iii-levelling only noteSHAMJITH KM
 

More from SHAMJITH KM (20)

Salah of the Prophet (ﷺ).pdf
Salah of the Prophet (ﷺ).pdfSalah of the Prophet (ﷺ).pdf
Salah of the Prophet (ﷺ).pdf
 
Construction Materials and Engineering - Module IV - Lecture Notes
Construction Materials and Engineering - Module IV - Lecture NotesConstruction Materials and Engineering - Module IV - Lecture Notes
Construction Materials and Engineering - Module IV - Lecture Notes
 
Construction Materials and Engineering - Module III - Lecture Notes
Construction Materials and Engineering - Module III - Lecture NotesConstruction Materials and Engineering - Module III - Lecture Notes
Construction Materials and Engineering - Module III - Lecture Notes
 
Construction Materials and Engineering - Module II - Lecture Notes
Construction Materials and Engineering - Module II - Lecture NotesConstruction Materials and Engineering - Module II - Lecture Notes
Construction Materials and Engineering - Module II - Lecture Notes
 
Construction Materials and Engineering - Module I - Lecture Notes
Construction Materials and Engineering - Module I - Lecture NotesConstruction Materials and Engineering - Module I - Lecture Notes
Construction Materials and Engineering - Module I - Lecture Notes
 
Computing fundamentals lab record - Polytechnics
Computing fundamentals lab record - PolytechnicsComputing fundamentals lab record - Polytechnics
Computing fundamentals lab record - Polytechnics
 
Concrete lab manual - Polytechnics
Concrete lab manual - PolytechnicsConcrete lab manual - Polytechnics
Concrete lab manual - Polytechnics
 
Concrete Technology Study Notes
Concrete Technology Study NotesConcrete Technology Study Notes
Concrete Technology Study Notes
 
നബി(സ)യുടെ നമസ്കാരം - രൂപവും പ്രാര്ത്ഥനകളും
നബി(സ)യുടെ നമസ്കാരം -  രൂപവും പ്രാര്ത്ഥനകളുംനബി(സ)യുടെ നമസ്കാരം -  രൂപവും പ്രാര്ത്ഥനകളും
നബി(സ)യുടെ നമസ്കാരം - രൂപവും പ്രാര്ത്ഥനകളും
 
Design of simple beam using staad pro - doc file
Design of simple beam using staad pro - doc fileDesign of simple beam using staad pro - doc file
Design of simple beam using staad pro - doc file
 
Design of simple beam using staad pro
Design of simple beam using staad proDesign of simple beam using staad pro
Design of simple beam using staad pro
 
Python programs - PPT file (Polytechnics)
Python programs - PPT file (Polytechnics)Python programs - PPT file (Polytechnics)
Python programs - PPT file (Polytechnics)
 
Python programs - first semester computer lab manual (polytechnics)
Python programs - first semester computer lab manual (polytechnics)Python programs - first semester computer lab manual (polytechnics)
Python programs - first semester computer lab manual (polytechnics)
 
Python programming Workshop SITTTR - Kalamassery
Python programming Workshop SITTTR - KalamasseryPython programming Workshop SITTTR - Kalamassery
Python programming Workshop SITTTR - Kalamassery
 
Analysis of simple beam using STAAD Pro (Exp No 1)
Analysis of simple beam using STAAD Pro (Exp No 1)Analysis of simple beam using STAAD Pro (Exp No 1)
Analysis of simple beam using STAAD Pro (Exp No 1)
 
Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures I - STUDENT NOTE BOOK (Polytechnics Revision 2015)
 
Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)
Theory of structures II - STUDENT NOTE BOOK (Polytechnics Revision 2015)
 
CAD Lab model viva questions
CAD Lab model viva questions CAD Lab model viva questions
CAD Lab model viva questions
 
Brain Computer Interface (BCI) - seminar PPT
Brain Computer Interface (BCI) -  seminar PPTBrain Computer Interface (BCI) -  seminar PPT
Brain Computer Interface (BCI) - seminar PPT
 
Surveying - Module iii-levelling only note
Surveying - Module  iii-levelling only noteSurveying - Module  iii-levelling only note
Surveying - Module iii-levelling only note
 

Recently uploaded

Nodal seismic construction requirements.pptx
Nodal seismic construction requirements.pptxNodal seismic construction requirements.pptx
Nodal seismic construction requirements.pptxwendy cai
 
EPE3163_Hydro power stations_Unit2_Lect2.pptx
EPE3163_Hydro power stations_Unit2_Lect2.pptxEPE3163_Hydro power stations_Unit2_Lect2.pptx
EPE3163_Hydro power stations_Unit2_Lect2.pptxJoseeMusabyimana
 
Test of Significance of Large Samples for Mean = µ.pptx
Test of Significance of Large Samples for Mean = µ.pptxTest of Significance of Large Samples for Mean = µ.pptx
Test of Significance of Large Samples for Mean = µ.pptxHome
 
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....santhyamuthu1
 
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...Amil baba
 
Engineering Mechanics Chapter 5 Equilibrium of a Rigid Body
Engineering Mechanics  Chapter 5  Equilibrium of a Rigid BodyEngineering Mechanics  Chapter 5  Equilibrium of a Rigid Body
Engineering Mechanics Chapter 5 Equilibrium of a Rigid BodyAhmadHajasad2
 
nvidia AI-gtc 2024 partial slide deck.pptx
nvidia AI-gtc 2024 partial slide deck.pptxnvidia AI-gtc 2024 partial slide deck.pptx
nvidia AI-gtc 2024 partial slide deck.pptxjasonsedano2
 
ChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai searchChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai searchrohitcse52
 
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docxSUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docxNaveenVerma126
 
Phase noise transfer functions.pptx
Phase noise transfer      functions.pptxPhase noise transfer      functions.pptx
Phase noise transfer functions.pptxSaiGouthamSunkara
 
Power System electrical and electronics .pptx
Power System electrical and electronics .pptxPower System electrical and electronics .pptx
Power System electrical and electronics .pptxMUKULKUMAR210
 
Modelling Guide for Timber Structures - FPInnovations
Modelling Guide for Timber Structures - FPInnovationsModelling Guide for Timber Structures - FPInnovations
Modelling Guide for Timber Structures - FPInnovationsYusuf Yıldız
 
Graphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesGraphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesDIPIKA83
 
UNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptxUNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptxrealme6igamerr
 
Design of Clutches and Brakes in Design of Machine Elements.pptx
Design of Clutches and Brakes in Design of Machine Elements.pptxDesign of Clutches and Brakes in Design of Machine Elements.pptx
Design of Clutches and Brakes in Design of Machine Elements.pptxYogeshKumarKJMIT
 
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptxVertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptxLMW Machine Tool Division
 
Gender Bias in Engineer, Honors 203 Project
Gender Bias in Engineer, Honors 203 ProjectGender Bias in Engineer, Honors 203 Project
Gender Bias in Engineer, Honors 203 Projectreemakb03
 

Recently uploaded (20)

Présentation IIRB 2024 Marine Cordonnier.pdf
Présentation IIRB 2024 Marine Cordonnier.pdfPrésentation IIRB 2024 Marine Cordonnier.pdf
Présentation IIRB 2024 Marine Cordonnier.pdf
 
Nodal seismic construction requirements.pptx
Nodal seismic construction requirements.pptxNodal seismic construction requirements.pptx
Nodal seismic construction requirements.pptx
 
EPE3163_Hydro power stations_Unit2_Lect2.pptx
EPE3163_Hydro power stations_Unit2_Lect2.pptxEPE3163_Hydro power stations_Unit2_Lect2.pptx
EPE3163_Hydro power stations_Unit2_Lect2.pptx
 
Lecture 2 .pdf
Lecture 2                           .pdfLecture 2                           .pdf
Lecture 2 .pdf
 
Test of Significance of Large Samples for Mean = µ.pptx
Test of Significance of Large Samples for Mean = µ.pptxTest of Significance of Large Samples for Mean = µ.pptx
Test of Significance of Large Samples for Mean = µ.pptx
 
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
 
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...
Popular-NO1 Kala Jadu Expert Specialist In Germany Kala Jadu Expert Specialis...
 
Engineering Mechanics Chapter 5 Equilibrium of a Rigid Body
Engineering Mechanics  Chapter 5  Equilibrium of a Rigid BodyEngineering Mechanics  Chapter 5  Equilibrium of a Rigid Body
Engineering Mechanics Chapter 5 Equilibrium of a Rigid Body
 
nvidia AI-gtc 2024 partial slide deck.pptx
nvidia AI-gtc 2024 partial slide deck.pptxnvidia AI-gtc 2024 partial slide deck.pptx
nvidia AI-gtc 2024 partial slide deck.pptx
 
ChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai searchChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai search
 
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docxSUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
 
Phase noise transfer functions.pptx
Phase noise transfer      functions.pptxPhase noise transfer      functions.pptx
Phase noise transfer functions.pptx
 
Power System electrical and electronics .pptx
Power System electrical and electronics .pptxPower System electrical and electronics .pptx
Power System electrical and electronics .pptx
 
Modelling Guide for Timber Structures - FPInnovations
Modelling Guide for Timber Structures - FPInnovationsModelling Guide for Timber Structures - FPInnovations
Modelling Guide for Timber Structures - FPInnovations
 
Graphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesGraphics Primitives and CG Display Devices
Graphics Primitives and CG Display Devices
 
UNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptxUNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptx
 
Design of Clutches and Brakes in Design of Machine Elements.pptx
Design of Clutches and Brakes in Design of Machine Elements.pptxDesign of Clutches and Brakes in Design of Machine Elements.pptx
Design of Clutches and Brakes in Design of Machine Elements.pptx
 
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptxVertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
 
計劃趕得上變化
計劃趕得上變化計劃趕得上變化
計劃趕得上變化
 
Gender Bias in Engineer, Honors 203 Project
Gender Bias in Engineer, Honors 203 ProjectGender Bias in Engineer, Honors 203 Project
Gender Bias in Engineer, Honors 203 Project
 

Numerical analysis dual, primal, revised simplex

  • 1. D Nagesh Kumar, IISc Optimization Methods: M3L51 Linear Programming Revised Simplex Method, Duality of LP problems and Sensitivity analysis
  • 2. D Nagesh Kumar, IISc Optimization Methods: M3L52 Introduction Revised simplex method is an improvement over simplex method. It is computationally more efficient and accurate. Duality of LP problem is a useful property that makes the problem easier in some cases Dual simplex method is computationally similar to simplex method. However, their approaches are different from each other. Primal-Dual relationship is also helpful in sensitivity or post optimality analysis of decision variables.
  • 3. D Nagesh Kumar, IISc Optimization Methods: M3L53 Objectives Objectives To explain revised simplex method To discuss about duality of LP and Primal-Dual relationship To illustrate dual simplex method To end with sensitivity or post optimality analysis
  • 4. D Nagesh Kumar, IISc Optimization Methods: M3L54 Revised Simplex method: Introduction Benefit of revised simplex method is clearly comprehended in case of large LP problems. In simplex method the entire simplex tableau is updated while a small part of it is used. The revised simplex method uses exactly the same steps as those in simplex method. The only difference occurs in the details of computing the entering variables and departing variable.
  • 5. D Nagesh Kumar, IISc Optimization Methods: M3L55 Revised Simplex method Consider the following LP problem (with general notations, after transforming it to its standard form and incorporating all required slack, surplus and artificial variables) ( ) ( ) ( ) ( ) 1 1 2 2 3 3 11 1 12 2 13 3 1 1 21 1 22 2 23 3 2 2 1 1 2 2 3 3 0n n i n n j n n l m m m mn n m Z c x c x c x c x Z x c x c x c x c x b x c x c x c x c x b x c x c x c x c x b + + + + + = + + + + = + + + + = + + + + = LLL LLL LLL M M M M M M LLL As the revised simplex method is mostly beneficial for large LP problems, it will be discussed in the context of matrix notation.
  • 6. D Nagesh Kumar, IISc Optimization Methods: M3L56 Revised Simplex method: Matrix form Matrix notation :with :subject to zMinimize T 0X BAX XC ≥ = = ⎥ ⎥ ⎥ ⎥ ⎦ ⎤ ⎢ ⎢ ⎢ ⎢ ⎣ ⎡ = nx x x M 2 1 X ⎥ ⎥ ⎥ ⎥ ⎦ ⎤ ⎢ ⎢ ⎢ ⎢ ⎣ ⎡ = nc c c M 2 1 C 1 2 m b b b ⎡ ⎤ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥= ⎢ ⎥ ⎢ ⎥ ⎢ ⎥⎣ ⎦ B M ⎥ ⎥ ⎥ ⎥ ⎦ ⎤ ⎢ ⎢ ⎢ ⎢ ⎣ ⎡ = 0 0 0 M 0 ⎥ ⎥ ⎥ ⎥ ⎦ ⎤ ⎢ ⎢ ⎢ ⎢ ⎣ ⎡ = mnmm n n ccc ccc ccc L MOMM L L 21 22221 11211 A where
  • 7. D Nagesh Kumar, IISc Optimization Methods: M3L57 Revised Simplex method: Notations Notations for subsequent discussions: Column vector corresponding to a decision variable is . is the column vector of basic variables is the row vector of cost coefficients corresponding to , and is the basis matrix corresponding to SX SX SC S SX kx ⎥ ⎥ ⎥ ⎥ ⎦ ⎤ ⎢ ⎢ ⎢ ⎢ ⎣ ⎡ mk k k c c c M 2 1
  • 8. D Nagesh Kumar, IISc Optimization Methods: M3L58 Revised Simplex method: Iterative steps 1. Selection of entering variable For each of the nonbasic variables, calculate the coefficient (WP - c), where, P is the corresponding column vector associated with the nonbasic variable at hand, c is the cost coefficient associated with that nonbasic variable and W = CS S -1 . For maximization (minimization) problem, nonbasic variable, having the lowest negative (highest positive) coefficient, as calculated above, is the entering variable.
  • 9. D Nagesh Kumar, IISc Optimization Methods: M3L59 Revised Simplex method: Iterative steps 2. Selection of departing variable a) A new column vector U is calculated as U = S-1 B b) Corresponding to the entering variable, another vector V is calculated as V = S-1 P, where P is the column vector corresponding to entering variable. c) It may be noted that length of both U and V is same (= m). For i = 1,…, m, the ratios, U(i)/V(i), are calculated provided V(i) > 0. i = r , for which the ratio is least, is noted. The r th basic variable of the current basis is the departing variable. If it is found that V(i) < 0 for all i, then further calculation is stopped concluding that bounded solution does not exist for the LP problem at hand.
  • 10. D Nagesh Kumar, IISc Optimization Methods: M3L510 Revised Simplex method: Iterative steps 3. Update to new Basis Old basis S, is updated to new basis Snew, as Snew = [ E S-1 ] -1 where ( ) ( ) ( )⎪ ⎪ ⎩ ⎪⎪ ⎨ ⎧ = ≠ = ri rV ri rV iV i for 1 for ηand r thcolumn 1 2 1 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 r m m η η η η η − ⎡ ⎤ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥= ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎢ ⎥ ⎣ ⎦ E L L L L M M O M L M M M M L L M M M M L M O M M L L L L
  • 11. D Nagesh Kumar, IISc Optimization Methods: M3L511 Revised Simplex method: Iterative steps S is replaced by Snew and steps1 through 3 are repeated. If all the coefficients calculated in step 1, i.e., is positive (negative) in case of maximization (minimization) problem, then optimum solution is reached The optimal solution is XS=S-1B and z = CXS
  • 12. D Nagesh Kumar, IISc Optimization Methods: M3L512 Duality of LP problems Each LP problem (called as Primal in this context) is associated with its counterpart known as Dual LP problem. Instead of primal, solving the dual LP problem is sometimes easier in following cases a) The dual has fewer constraints than primal Time required for solving LP problems is directly affected by the number of constraints, i.e., number of iterations necessary to converge to an optimum solution, which in Simplex method usually ranges from 1.5 to 3 times the number of structural constraints in the problem b) The dual involves maximization of an objective function It may be possible to avoid artificial variables that otherwise would be used in a primal minimization problem.
  • 13. D Nagesh Kumar, IISc Optimization Methods: M3L513 Finding Dual of a LP problem Inequality sign of ith Constraint: if dual is maximization if dual is minimization xi > 0 jth variablejth constraint ith constraintith variable MaximizationMinimization MinimizationMaximization DualPrimal ≥ ≤ …contd. to next slide
  • 14. D Nagesh Kumar, IISc Optimization Methods: M3L514 Finding Dual of a LP problem…contd. RHS of ith constraint constraints Cost coefficient associated with ith variable in the objective function Cost coefficient associated with jth variable in the objective function RHS of jth constraint jth variable unrestrictedjth constraint with = sign ith constraint with = signith variable unrestricted DualPrimal Refer class notes for pictorial representation of all the operations
  • 15. D Nagesh Kumar, IISc Optimization Methods: M3L515 Dual from a Primal
  • 16. D Nagesh Kumar, IISc Optimization Methods: M3L516 Finding Dual of a LP problem…contd. Note: Before finding its dual, all the constraints should be transformed to ‘less-than-equal-to’ or ‘equal-to’ type for maximization problem and to ‘greater-than-equal-to’ or ‘equal-to’ type for minimization problem. It can be done by multiplying with -1 both sides of the constraints, so that inequality sign gets reversed.
  • 17. D Nagesh Kumar, IISc Optimization Methods: M3L517 Finding Dual of a LP problem: An example Primal Dual Maximize Minimize Subject to Subject to 6000 3 2 21 ≤+ xx 200021 ≥− xx 40001 ≤x 3 3 2 21 ≤+ yy 4321 =+− yyy 1 unrestrictedx 02 ≥x 01 ≥y 02 ≥y 21 34 xxZ += 321 400020006000 yyyZ +−=′ Note: Second constraint in the primal is transformed to before constructing the dual. 1 2 2000x x− + ≤ − 03 ≥y
  • 18. D Nagesh Kumar, IISc Optimization Methods: M3L518 Primal-Dual relationships If one problem (either primal or dual) has an optimal feasible solution, other problem also has an optimal feasible solution. The optimal objective function value is same for both primal and dual. If one problem has no solution (infeasible), the other problem is either infeasible or unbounded. If one problem is unbounded the other problem is infeasible.
  • 19. D Nagesh Kumar, IISc Optimization Methods: M3L519 Dual Simplex Method Simplex Method verses Dual Simplex Method 1. Simplex method starts with a nonoptimal but feasible solution where as dual simplex method starts with an optimal but infeasible solution. 2. Simplex method maintains the feasibility during successive iterations where as dual simplex method maintains the optimality.
  • 20. D Nagesh Kumar, IISc Optimization Methods: M3L520 Dual Simplex Method: Iterative steps Steps involved in the dual simplex method are: 1. All the constraints (except those with equality (=) sign) are modified to ‘less-than-equal-to’ sign. Constraints with greater-than-equal-to’ sign are multiplied by -1 through out so that inequality sign gets reversed. Finally, all these constraints are transformed to equality sign by introducing required slack variables. 2. Modified problem, as in step one, is expressed in the form of a simplex tableau. If all the cost coefficients are positive (i.e., optimality condition is satisfied) and one or more basic variables have negative values (i.e., non-feasible solution), then dual simplex method is applicable.
  • 21. D Nagesh Kumar, IISc Optimization Methods: M3L521 Dual Simplex Method: Iterative steps…contd. 3. Selection of exiting variable: The basic variable with the highest negative value is the exiting variable. If there are two candidates for exiting variable, any one is selected. The row of the selected exiting variable is marked as pivotal row. 4. Selection of entering variable: Cost coefficients, corresponding to all the negative elements of the pivotal row, are identified. Their ratios are calculated after changing the sign of the elements of pivotal row, i.e., The column corresponding to minimum ratio is identified as the pivotal column and associated decision variable is the entering variable. ⎟⎟ ⎠ ⎞ ⎜⎜ ⎝ ⎛ ×− = rowpivotalofElements tsCoefficienCost ratio 1
  • 22. D Nagesh Kumar, IISc Optimization Methods: M3L522 Dual Simplex Method: Iterative steps…contd. 5. Pivotal operation: Pivotal operation is exactly same as in the case of simplex method, considering the pivotal element as the element at the intersection of pivotal row and pivotal column. 6. Check for optimality: If all the basic variables have nonnegative values then the optimum solution is reached. Otherwise, Steps 3 to 5 are repeated until the optimum is reached.
  • 23. D Nagesh Kumar, IISc Optimization Methods: M3L523 Dual Simplex Method: An Example Consider the following problem: 12 1234 2443 2tosubject 2Minimize 21 21 21 1 21 ≥+− ≥+ ≤+ ≥ += xx xx xx x xxZ
  • 24. D Nagesh Kumar, IISc Optimization Methods: M3L524 Dual Simplex Method: An Example…contd. After introducing the surplus variables the problem is reformulated with equality constraints as follows: 12 1234 2443 2tosubject 2Minimize 621 521 421 31 21 −=+− −=+−− =++ −=+− += xxx xxx xxx xx xxZ
  • 25. D Nagesh Kumar, IISc Optimization Methods: M3L525 Dual Simplex Method: An Example…contd. Expressing the problem in the tableau form:
  • 26. D Nagesh Kumar, IISc Optimization Methods: M3L526 Dual Simplex Method: An Example…contd. Successive iterations:
  • 27. D Nagesh Kumar, IISc Optimization Methods: M3L527 Dual Simplex Method: An Example…contd. Successive iterations:
  • 28. D Nagesh Kumar, IISc Optimization Methods: M3L528 Dual Simplex Method: An Example…contd. Successive iterations: As all the br are positive, optimum solution is reached. Thus, the optimal solution is Z = 5.5 with x1 = 2 and x2 = 1.5
  • 29. D Nagesh Kumar, IISc Optimization Methods: M3L529 Solution of Dual from Primal Simplex 0,, 2222 124 452tosubject 406'Minimize 321 321 321 321 321 ≥ ≥−+ −≥−− ≥++ ++= yyy yyy yyy yyy yyyZ Primal Dual 0,, 4225 024 622tosubject 24Maximize 321 321 321 321 321 ≥ ≤−− ≤+− ≤++ +−= xxx xxx xxx xxx xxxZ y1 y2 y3 Z’
  • 30. D Nagesh Kumar, IISc Optimization Methods: M3L530 Sensitivity or post optimality analysis • Changes that can affect only Optimality • Change in coefficients of the objective function, C1, C2,.. • Re-solve the problem to obtain the solution • Changes that can affect only Feasibility • Change in right hand side values, b1, b2,.. • Apply dual simplex method or study the dual variable values • Changes that can affect both Optimality and Feasibility • Simultaneous change in C1, C2,.. and b1, b2,.. • Use both primal simplex and dual simplex or re-solve
  • 31. D Nagesh Kumar, IISc Optimization Methods: M3L531 Sensitivity or post optimality analysis A dual variable, associated with a constraint, indicates a change in Z value (optimum) for a small change in RHS of that constraint. j iZ y bΔ = Δ where yj is the dual variable associated with the ith constraint, Δbi is the small change in the RHS of ith constraint, ΔZ is the change in objective function owing to Δbi.
  • 32. D Nagesh Kumar, IISc Optimization Methods: M3L532 Sensitivity or post optimality analysis: An Example Let, for a LP problem, ith constraint be and the optimum value of the objective function be 250. RHS of the ith constraint changes to 55, i.e., ith constraint changes to Let, dual variable associated with the ith constraint is yj , optimum value of which is 2.5 (say). Thus, Δbi = 55 – 50 = 5 and yj = 2.5 So, ΔZ = yj Δbi = 2.5x5 = 12.5 and revised optimum value of the objective function is 250 + 12.5 = 262.5. 1 22 50x x+ ≤ 1 22 55x x+ ≤
  • 33. D Nagesh Kumar, IISc Optimization Methods: M3L533 Thank You