Unformatted text preview: α , β , γ , δ and ε in the tableau are unknown parameters. z + δx 4 + γx 5 = x 2 + αx 4 = 3 x 32 x 4 + εx 5 = 2 x 1 + 2 x 5 = β For each of the following statements, ±nd conditions on the values of α , β , γ , δ and ε such that the statement is true. (a) The basic solution is not feasible. (b) The basic solution is feasible, but the tableau is not optimal. (c) The basic solution is feasible, x 5 is a candidate for entering the basis, and when x 5 enters the basis, then x 3 must leave the basis. (d) The basic solution is feasible and the next iteration, under the smallest subscript rule (see Section 6.6), indicates that the problem is unbounded. 1...
View
Full Document
 Fall '10
 GUENIN
 Operations Research, Linear Programming, Optimization, Simplex algorithm, basic solution, smallest subscript rule

Click to edit the document details