This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Economics 146 – Fall, 2007 Linear Programming – Part III Last revision: 10/22/07. Artificial Basis Vectors. If an LP problem in computational form has no obvious initial basis, one method to use to start the simplex method is to introduce artificial basis vectors. We give an example first. Consider the following LP problem in computational form (which we did not get from a max problem in standard form): minimize x 1 2 x 2 3 x 3 + x 4 subject to x 1 +2 x 2 +3 x 3 = 15 2 x 1 + x 2 +5 x 3 = 20 x 1 + 2 x 2 + x 3 + x 4 = 10 and x 1 , . . . , x 4 ≥ (1) The simplex tableau (with no initial feasible basis chosen yet) is: 1 2 3 1 a 1 a 2 a 3 a 4 c 1 2 3 15 2 1 5 20 1 2 1 1 10 (2) Note that there is no obvious choice for an initial feasible basis. (We did not get this problem by adding slack variables to a problem in standard maximum form.) There is a good choice for one basis vector, viz. a 4 . We will augment the problem by adding two new artificial variables x 5 , x 6 and two new artificial basis vectors...
View
Full
Document
This note was uploaded on 09/23/2008 for the course ECON 146 taught by Professor Farmer during the Fall '07 term at UCLA.
 Fall '07
 farmer
 Economics

Click to edit the document details