examples2

# examples2 - (c The corresponding basic solution is feasible...

This preview shows page 1. Sign up to view the full content.

IE521 Advanced Optimization Example Set 2 Fall 2011 1. Consider a linear programming problem in the standard form, described in terms of the following initial tableau: The entries α,γ,δ,ξ,η in the tableau are unknown parameters. 0 0 0 0 δ 3 γ η β 0 1 0 α 1 0 3 2 0 0 1 -2 2 ξ -1 3 1 0 0 0 -1 2 1 Let B be the basis matrix corresponding to having x 2 ,x 3 ,x 1 be the basic variables. For each of the following statements ﬁnd the ranges of values of the various parameters that will make the stament to be true. (a) Phase II of the simplex method can be applied using this as an initial tableau. (b) The corresponding basic solution is feasible, but we do not have an optimal basis.
This is the end of the preview. Sign up to access the rest of the document.

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

{[ snackBarMessage ]}

Ask a homework question - tutors are online