lecture10 - e62: lecture 10 18/10/10 x 1 x 2 x 3 Simplex...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: e62: lecture 10 18/10/10 x 1 x 2 x 3 Simplex Algorithm 1 pick initial BFS encoding: B let m be index of maximizing (nonbasic) variable compute reduced prots increase until a basic variable becomes 0 add m to B and remove new nonbasic variable maximum positive? yes no N =3, M =1 vertex: ! 1 basic variable ! 2 nonbasic variables m = 3 B = { 1 } B = { 3 } e62: lecture 10 18/10/10 Degeneracy and Cycling Def. degeneracy = when there is a zero-valued basic variable Example where N =5, M =3 (3 basic variables) Intersection of N+1 constraint boundaries Def. cycling = keep swapping basic variables without changing solution 2 1.5 3 4.5 6 1 2 3 4 5 e62: lecture 10 18/10/10 Initialization Simple case Symmetric form LP If b nonnegative then the origin is a vertex General case Multiple methods One approach: big-M method 3 max cx s . t . Ax b x e62: lecture 10 18/10/10 Minimum Cost Network Flows Network nodes Directed edges Decision variables = ows...
View Full Document

This note was uploaded on 07/29/2011 for the course MS&E 111 at Stanford.

Page1 / 2

lecture10 - e62: lecture 10 18/10/10 x 1 x 2 x 3 Simplex...

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