On Scolnik's Proposed Polynomial-Time Linear Programming Algorithm
Gay, David M.
At a recent symposium, Hugo Sccolnik expressed some ideas leading to an algorithm which he thought might solve the linear programming problem in polynomial time. We examine the algorithm and find that it often fails to solve the linear programming problem, even in the special cases considered by Scolnik. We conclude that the algorithm probably cannot be modified to work properly.
computer science; technical report
Previously Published As