Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time

Details Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time

2006-11-02

arxiv.org/abs/cs/0611008v1

Computer Science

Computational Complexity

Scientific paper

This article discusses ability of Linear Programming models to be used as solvers of NP-complete problems. Integer Linear Programming is known as NP-complete problem, but non-integer Linear Programming problems can be solved in polynomial time, what places them in P class. During past three years there appeared some articles using LP to solve NP-complete problems. This methods use large number of variables (O(n^9)) solving correctly almost all instances that can be solved in reasonable time. Can they solve infinitively large instances? This article gives answer to this question.

Affiliated with

Also associated with

No associations

Rating

Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Why Linear Programming cannot solve large instances of NP-complete problems in polynomial time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-291882