This preview shows page 1. Sign up to view the full content.
Unformatted text preview: the second and third constraints. The feasible solution = 0, = 5, = 10, where the constraints are linearly dependent, is known as a degenerate solution. Degeneracy is a significant feature of linear programming, allowing the theoretical possibility of a breakdown in the simplex algorithm. Fortunately, such breakdown seems very rare in practice. Degeneracy at the optimal solution indicates multiple optima. One way to proceed in this example is to arbitrarily designate one constraint as redun- dant, assuming the corresponding multiplier is zero. Arbitrarily choosing = 0 and proceeding as before, complementary slackness ( > 0) requires that = 3 2 = 0 or = 3 2 (5.106) Nonnegativity of implies that 3 2 . Substituting (5.106) in the second first-order condition yields = 1 2 2 = 1 2 2(3...
View Full Document
This note was uploaded on 01/16/2012 for the course ECO 2024 taught by Professor Dr.dumond during the Fall '10 term at FSU.
- Fall '10