Re:Suits, Money Laundering, and Linear Programming
by JohnKemeny on Friday November 01, 2024 @06:40AM
(#42015620)
> should never work given its exponential worst case performance
This is again not true. We know why it works well. See the paper
"Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time"
by Spielmann and Teng.
Re:Suits, Money Laundering, and Linear Programming
by whatever1 on Friday November 01, 2024 @11:50AM
(#42018191)
We started understanding of why it works so well like 30 years after its first implementation (in the 1950's)? The paper you mention is written in the 2000s while the Simplex dominated the field from at least the 70's.
Meanwhile the GP would have discarded the simplex algorithm due to its worst case performance.
Re:Suits, Money Laundering, and Linear Programming
by SkiFire13 on Friday November 01, 2024 @07:40AM
(#42015950)
> Simplex algorithm should never work given its exponential worst case performance.
Note that it has been proven however that if you slightly perturbate the inputs then the expected complexity becomes polynomial, meaning the inputs for which it's exponential are actually just pathological cases and it is polynomial in practice.
Re:Suits, Money Laundering, and Linear Programming
by FooBarBizBazz on Saturday November 02, 2024 @09:34AM
(#42026296)
Man, there was a lot of obtuse argument to wade through to get to this post. This is an interesting fact. Apparently this is the source?
Worst case performance or NP completeness is not a predictor of how fast we can solve an optimization problem.