Engineering Optimization: Theory and Practice, Fourth Edition

154 Linear Programming I: Simplex Method

Figure 3.15 (continued)

the complete array of equations can be written as

3 x 1 − 3 x 2 + 4 x 3 + 2 x 4 −x 5 +y 1 = 0

x 1 +x 2 +x 3 + 3 x 4 +x 5 +y 2 = 2

2 x 1 + 3 x 2 + 2 x 3 −x 4 +x 5 −f = 0

y 1 +y 2 −w= 0

(E 2 )