谢谢
1. For general linear programming, is interior point method still the
fastest in term of time complexity? I've heard that Karmarkar's algorithm
was bounded by O(n3.5 L), any improvement afterwards?
2. Is the strong-polynomial algorithm for linear programming still a hot
research direction? how does experts in this area, such as you, perceive the
difficulty and existence of strong-polynomial algorithm?
3. How about the average time complexity? We knew that about Simplex method.
Is there any re