Wait, so this is straight up gradient ascent on the vertices of the feasable set? I always thought the simplex method was more complicated than that. I guess you do need to maintain some kind of queue of current-best vertices.
If we squint a bit do we get Dijkstra's algorithm?
If we squint a bit do we get Dijkstra's algorithm?