3 ms·
Linear programming is not NP-hard, worst case or no. The interior point method [1] solves it in polynomial time. [1] http://en.wikipedia.org/wiki/Interior_poi
by abetusk 12y ago
Linear programming is not NP-hard, worst case or no. The interior point method [1] solves it in polynomial time.
[1] http://en.wikipedia.org/wiki/Interior_point_method http://en.wikipedia.org/wiki/Interior_point_method