Scribd
Upload
374 views

Optimization Methods

The document summarizes and compares four different optimization methods: the simplex method, big M method, dual simplex method, and two phase method. Each method has different requirements for the objective function type, how variables are added to constraints, optimality test requirements, how θ and key column/row values are calculated. The methods can be used to solve problems with objectives of maximization or minimization and constraints that are less than or equal to or greater than or equal to.

Uploaded by

raviam
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
374 views

Optimization Methods

The document summarizes and compares four different optimization methods: the simplex method, big M method, dual simplex method, and two phase method. Each method has different requirements for the objective function type, how variables are added to constraints, optimality test requirements, how θ and key column/row values are calculated. The methods can be used to solve problems with objectives of maximization or minimization and constraints that are less than or equal to or greater than or equal to.

Uploaded by

raviam
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

OPTIMIZATION METHODS

SL.
DESCRIPTION SIMPLEX METHOD BIG M METHOD DUAL SIMPLEX METHOD TWO PHASE METHOD
NO

Z max, any one constraints Z max, any one constraints


Obejctive funtion Z max, all constraints Z max, all constraints are ≤
1 may be either = or ≥ , RHS may be either = or ≥ , RHS
type are ≤ , RHS +Ve values. , RHS may be -Ve values also.
+Ve values. +Ve values.

Variables addition For ≤ add +S, For ≥ add - For ≤ add +S, For ≥ add -
2 All are +S only All are +S only
in constraints S+R, For = add +R S+R, For = add +R

For S add +0S, For R add -


Variables addition
For S add +0S, For R add - 1R. Cost of x is 0 in phase
3 in objective +0S +0S
mR 1 & in Phase 2 it's as given
function.
in problem.

Optimality test
4 Zj-Cj≥0 Zj-Cj≥0 Zj-Cj≥0 and also Xb≥0 Zj-Cj≥0
rqmt

5 θ value Xb/Aic; Aic≥0 Xb/Aic; Aic≥0 Zj-Cj/Air; Air≤0 Xb/Aic; Aic≥0

Most -Ve value of Zj-Cj in


6 Key column Most -Ve value of Zj-Cj terms of m as 1st priority & Max. θ value Most -Ve value of Zj-Cj
numbers 2 nd priority.

7 Key row Min. θ value Min. θ value Most -Ve value of Xb Min. θ value

You might also like