Lecture 8 - Linear Programming with Equality Constraints

Lecture 8 - Linear Programming with Equality Constraints -...

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

View Full Document Right Arrow Icon
Lecture 8 Linear Programming with Equality Constraints UCSD Math 171A: Numerical Optimization Philip E. Gill ( pgill@ucsd.edu ) Friday, January 23, 2009 Linear programming First, we consider a special class of LP’s with equality constraints ELP minimize x R n c T x subject to Ax = b , The feasible region is IF = { x R n : Ax = b } UCSD Center for Computational Mathematics Slide 2/29, Friday, January 23, 2009 Reasonable assumptions on the problem: A1. A has full rank A2. b range( A ) (i.e., IF is not empty). Definition x * is a minimizer of ELP if c T x * c T x for all x IF = { x R n : Ax = b } (i.e., ( x * ) ( x ) for all feasible x ). UCSD Center for Computational Mathematics Slide 3/29, Friday, January 23, 2009 An obvious case: If m n , then any x * such that Ax * = b is the unique minimizer of ( x ) because IF contains only one point. Without loss of generality, we assume that m < n , i.e., A = IF contains infinitely many points for all vectors b . UCSD Center for Computational Mathematics Slide 4/29, Friday, January 23, 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
The standard strategy Given a non-optimal point ¯ x , find a direction p such that positive steps α along p give points ¯ x + α p that are feasible and give x + α p ) < ‘ x ) The direction p is known as a feasible direction . A precise definition follows: UCSD Center for Computational Mathematics Slide 5/29, Friday, January 23, 2009 Definition Given a feasible ¯ x , p is a feasible direction if p 6 = 0 and there exists a step σ > 0 such that ¯ x + α p is feasible for all α such that 0 < α σ (i.e., positive steps that cannot be longer than σ .) The step σ is called the maximum feasible step in the direction p . UCSD Center for Computational Mathematics Slide 6/29, Friday, January 23, 2009 ¯ x p ¯ x + σp feasible points How can we characterize the set of all such feasible directions? UCSD Center for Computational Mathematics
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 / 8

Lecture 8 - Linear Programming with Equality 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