L05_Artificial Variable techniques - Big M method

L05_Artificial Variable techniques - Big M method -...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Artificial Variable Techniques Big M-method Lecture 6 Abstract If in a starting simplex tableau, we dont have an identity submatrix (i.e. an obvious starting BFS), then we introduce artificial variables to have a starting BFS. This is known as artificial variable technique. There are two methods to find the starting BFS and solve the problem the Big M method and two-phase method. In this lecture, we discuss the Big M method. Suppose a constraint equation i does not have a slack variable. i.e. there is no ith unit vector column in the LHS of the constraint equations. (This happens for example when the ith constraint in the original LPP is either or = .) Then we augment the equation with an artificial variable R i to form the ith unit vector column. However as the artificial variable is extraneous to the given LPP, we use a feedback mechanism in which the optimization process automatically attempts to force these variables to zero level. This is achieved by giving a large penalty to the coefficient of the artificial variable in the objective function as follows: Artificial variable objective coefficient = - M in a maximization problem, = M in a minimization problem where M is a very large positive number. Consider the LPP: Minimize 2 1 2 x x z + = Subject to the constraints , 6 9 3 2 1 2 1 2 1 + + x x x x x x Putting this in the standard form, the LPP is: 2 1 2 x x z + = Subject to the constraints 1 2 1 1 2 2 1 2 1 2 3 9 6 , , , 0 x x s x x s x x s s + - = + - =...
View Full Document

This note was uploaded on 02/23/2011 for the course MATH 112 taught by Professor Ritadubey during the Spring '11 term at Amity University.

Page1 / 26

L05_Artificial Variable techniques - Big M method -...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online