Lecture 9 - Feasible Directions for Inequality Constraints

Lecture 9 - Feasible Directions for Inequality Constraints...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 9 Feasible Directions for Inequality Constraints UCSD Math 171A: Numerical Optimization Philip E. Gill ( pgill@ucsd.edu ) Monday, January 26, 2009 Recap: Linear programming with equality constraints LP’s with equality constraints ELP minimize x R n c T x subject to Ax = b , UCSD Center for Computational Mathematics Slide 2/34, Monday, January 26, 2009 Optimality conditions for ELP Result Consider minimizing ( x ) = c T x subject to Ax = b . (a) If Ax = b is incompatible, no solution exists; (b) If Ax = b is compatible and c does not lie in the range of A T , the objective function is unbounded below at feasible points; (c) If Ax = b is compatible and c lies in the range of A T (so that c = A T λ * for some vector λ * ), then: (i) * , the optimal value of , is finite and unique; (ii) Every feasible point is a minimizer x * ; (iii) x * is unique if and only if the columns of A are linearly independent; (iv) λ * is unique if and only if the rows of A are linearly independent. UCSD Center for Computational Mathematics Slide 3/34, Monday, January 26, 2009 x = solve(A,b) If incompatible, no feasible point exists If compatible, x is feasible lambda = solve(A’,c) If incompatible, no bounded solution If compatible, x is a minimizer UCSD Center for Computational Mathematics Slide 4/34, Monday, January 26, 2009
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example 1: A = - 1 5 0 1 1 3 - 1 1 4 2 ! , b = 4 - 5 ! , c = - 4 6 - 1 - 3 - 1 Feasibility? x * = solve(A,b) x * = 0 1 0 - 1 0 , which is a basic solution of Ax = b UCSD Center for Computational Mathematics Slide 5/34, Monday, January 26, 2009 Example 1: (continued) A = - 1 5 0 1 1 3 - 1 1 4 2 ! , b = 4 - 5 ! , c = - 4 6 - 1 - 3 - 1 Optimality? λ * = solve(A’,c) λ * = 1 - 1 ! , which are unique Lagrange multipliers x * is optimal, with ( x * ) = c T x * = 9. UCSD Center for Computational Mathematics Slide 6/34, Monday, January 26, 2009 Example 1: (continued) A = - 1 5 0 1 1 3 - 1 1 4 2 ! , b = 4 - 5 ! , c = - 4 6 - 1 - 3 - 1 Note that b x = - 3 2 1 2 0 0 0 is another basic solution, with ( b x ) = c T b x = 9. UCSD Center for Computational Mathematics Slide 7/34, Monday, January 26, 2009 Example 2: A = - 1 5 0 1 1 3 - 1 1 4 2 ! , b
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/23/2010 for the course MATH 171a taught by Professor Staff during the Winter '08 term at UCSD.

Page1 / 9

Lecture 9 - Feasible Directions for Inequality Constraints...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online