Unformatted text preview: (c) The corresponding basic solution is feasible and the ﬁrst simplex iteration indicates that the optimal cost is∞ . (d) The corresponding basic solution is feasible , x 6 is a candidate for entering the basis, and when x 6 is the entering variable, x 3 leaves the basis. (e) The corresponding basic solution is feasible , x 7 is a candidate for entering the basis, but if t does, the solution and the objective value remain unchanged. 1...
View
Full Document
 Fall '11
 ZelihaAkça
 Operations Research, Linear Programming, Optimization, Simplex algorithm, George Dantzig

Click to edit the document details