Lecture20Notes

Lecture20Notes - C&O 355: Mathematical Programming Fall...

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

View Full Document Right Arrow Icon
Fall 2010 Lecture 20 Notes Nicholas Harvey http://www.math.uwaterloo.ca/~harvey/ 1 Finding Neighbouring Vertices in the Simplex Method Let x be a basic feasible solution of the polyhedron P = { x : Ax b } . Let B be the subset of the constraints that are tight at x . Let A B denote the submatrix of A corresponding to these constraints. Similarly, let b B denote the portion of b corresponding to these constraints. So A B x = b B holds. Assume that we have perturbed the matrix A such that each vertex of P has exactly n tight constraints. Then | B | = n , so A B is square. Since x is a basic feasible solution, rank A B = n , and so A B is invertible. Since A B is invertible, we can express the objective function c as a linear combination of the tight constraints. That is, there exists a vector u such that c T = u T A B . Case 1: u 0 . In this case, we have expressed the objective function as a non-negative linear combination of the constraints that are tight at
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/16/2011 for the course CO 355 taught by Professor Harvey during the Winter '10 term at Waterloo.

Page1 / 2

Lecture20Notes - C&O 355: Mathematical Programming Fall...

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

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