Linear Programming Lecture Notes - Penn State Personal Web Server
Linear Programming Lecture Notes - Penn State Personal Web Server
Linear Programming Lecture Notes - Penn State Personal Web Server
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Here 0 is the vector of zeros of appropriate size. This equation can be written as:<br />
(5.26) z + 0 T xB + c T BB −1 N − c T <br />
N xN = c T BB −1 b<br />
We can now represent this set of equations as a large matrix (or tableau):<br />
z xB xN RHS<br />
z 1 0 c T B B−1 N − c T N cT B B−1 b Row 0<br />
xB 0 1 B −1 N B −1 b Rows 1 through m<br />
The augmented matrix shown within the table:<br />
<br />
(5.27)<br />
1 0 c T B B −1 N − c T N cT B B−1 b<br />
0 1 B −1 N B −1 b<br />
is simply the matrix representation of the simultaneous equations described by Equations<br />
5.23 and 5.26. We can see that the first row consists of a row of the first row of the<br />
(m + 1) × (m + 1) identity matrix, the reduced costs of the non-basic variables and the<br />
current objective function values. The remainder of the rows consist of the rest of the<br />
(m + 1) × (m + 1) identity matrix, the matrix B −1 N and B −1 b the current non-zero part of<br />
the basic feasible solution.<br />
This matrix representation (or tableau representation) contains all of the information<br />
we need to execute the simplex algorithm. An entering variable is chosen from among the<br />
columns containing the reduced costs and matrix B −1 N. Naturally, a column with a negative<br />
reduced cost is chosen. We then chose a leaving variable by performing the minimum ratio<br />
test on the chosen column and the right-hand-side (RHS) column. We pivot on the element<br />
at the entering column and leaving row and this transforms the tableau into a new tableau<br />
that represents the new basic feasible solution.<br />
Example 5.10. Again, consider the toy maker problem. We will execute the simplex<br />
algorithm using the tableau method. Our problem in standard form is given as:<br />
⎧<br />
⎪⎨<br />
⎪⎩<br />
max z(x1, x2) = 7x1 + 6x2<br />
s.t. 3x1 + x2 + s1 = 120<br />
x1 + 2x2 + s2 = 160<br />
x1 + s3 = 35<br />
x1, x2, s1, s2, s3 ≥ 0<br />
We can assume our initial basic feasible solution has s1, s2 and s3 as basic variables and x1<br />
and x2 as non-basic variables. Thus our initial tableau is simply:<br />
⎡<br />
⎤<br />
z x1 x2 s1 s2 s3 RHS<br />
z ⎢ 1 −7 −6 0 0 0 0 ⎥<br />
(5.28) s1 ⎢ 0 3 1 1 0 0 120 ⎥<br />
s2 ⎣ 0 1 2 0 1 0 160 ⎦<br />
0 1 0 0 0 1 35<br />
s3<br />
Note that the columns have been swapped so that the identity matrix is divided and B −1 N<br />
is located in columns 2 and 3. This is because of our choice of basic variables. The reduced<br />
cost vector is in Row 0.<br />
79