Re:Linear Programming: How Does It Work?
by mathgenius on Monday June 06, 2016 @02:40AM
(#11845048)
You need a queue of current-best vertices when the objective function is equal best on all those vertices. Obviously you don't need to search less optimal vertices.
Either you have a neighboring vertex that is strictly better than your current solution, or you have found an optimal solution. I don't think you need to store vertices with equal value, because you never backtrack.
Re:Linear Programming: How Does It Work?
by mathgenius on Monday June 06, 2016 @11:21AM
(#11847410)
Ok, I think I'm getting it. This line from the OP confused me:
'But there’s an obvious risk of winding up in a “cycle” where you get back to a vertex that you already hit earlier–in which case the program will never terminate.'
You only get a cycle if multiple vertices have the same objective function value. There's a similar problem of degeneracy, where you pivot back and forth between binding constraints on the same vertex and never go anywhere.
And a way to avoid cycles in simplex is known: https://en.wikipedia.org/wiki/Bland%27s_rule
Basically you visit all vertex in sequence moving along the boundary of the solution space. As soon the result start decreasing you are done.