arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0611008cs.CCcs.DMcs.DScs.NAmath.NA
收藏

为什么线性规划无法在多项式时间内解决NP完全问题的大规模实例

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

Radoslaw Hofman

AI总结:

本文论证线性规划(含大量变量)无法在多项式时间内求解无限大的NP完全问题实例,并给出否定答案。

摘要:

本文探讨了线性规划模型作为NP完全问题求解器的能力。整数线性规划已知是NP完全问题,但非整数线性规划问题可以在多项式时间内求解,因此属于P类。在过去三年中,出现了一些使用线性规划求解NP完全问题的文章。这些方法使用大量变量(O(n^9)),能正确求解几乎所有可在合理时间内解决的实例。它们能否求解无限大的实例?本文对这一问题给出了答案。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑