{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture6

# Lecture6 - C&O 355 Lecture 6 N Harvey...

This preview shows pages 1–8. Sign up to view the full content.

C&O 355 Lecture 6 N. Harvey http://www.math.uwaterloo.ca/~harvey/

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

View Full Document
Outline Proof of Optimality Does the algorithm terminate? Bland’s Rule Corollaries
1. What is a corner point? (BFS and bases) 2. What if there are no corner points? (Infeasible) 3. What are the “neighboring” bases? (Increase one coordinate) 4. What if no neighbors are strictly better? (Might move to a basis that isn’t strictly better (if ± =0), but whenever x changes it’s strictly better) 5. How can I find a starting feasible basis? 6. Does the algorithm terminate? 7. Does it produce the right answer? Local-Search Algorithm Let B be a feasible basis (If none, Halt: LP is infeasible) For each entering coordinate k B If “benefit” of coordinate k is > 0 Compute y( ± ) (If ± = 1 , Halt: LP is unbounded) Find leaving coordinate h 2 B (y( ± ) h =0) Set x=y( ± ) and B’= B n {h} [ {k} Halt: return x

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

View Full Document
The Benefits Vector Recall: Benefit of coordinate k is c k - c B T A B -1 A k Let’s define a benefits vector r to record all the benefits Define: Note: For k B, r k is benefit of coordinate k For k 2 B, r k =0 Claim: For any point z, we have c T z = c T x + r B T z B Proof:
Quick Optimality Proof Suppose algorithm terminates with BFS x and basis B Claim: x is optimal. Proof: Loop terminates ) every k B has benefit · 0 ) r · 0 For any feasible point z, we have: c T z = c T x + r B T z B · c T x ) x is optimal. ¥ ¸ 0 since z feasible · 0 since loop terminated

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

View Full Document
1. What is a corner point? (BFS and bases) 2. What if there are no corner points? (Infeasible) 3. What are the “neighboring” bases? (Increase one coordinate) 4. What if no neighbors are strictly better? (Might move to a basis that isn’t strictly better (if ± =0), but whenever x changes it’s strictly better) 5. How can I find a starting feasible basis? 6. Does the algorithm terminate? 7. Does it produce the right answer? (Yes) Local-Search Algorithm Let B be a feasible basis (If none, Halt: LP is infeasible) For each entering coordinate k B If “benefit” of coordinate k is > 0 Compute y( ± ) (If ± = 1 , Halt: LP is unbounded) Find leaving coordinate h 2 B (y( ± ) h =0) Set x=y( ± ) and B’= B n {h} [ {k} Halt: return x
Does Algorithm Terminate?

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}