The Simplex Algorithm (Dentzig,1947) y is a neighbor ofx if 3 an edge between x and y find a vertex x; repeat: pick a neighbor y with cTy cTx; x←-y; until no such y.find a vertex x; repeat: pick a neighbor y with cTy < cTx; x ← y; until no such y. The Simplex Algorithm y is a neighbor of x if ∃ an edge between x and y (Dentzig, 1947)