|
|||||
|
|
Some NP-complete problems in linear programming |
|
| Authors: | R. Chandrasekaran Santosh N. Kabadi Katta G. Murthy |
| Affiliation: | School of Management and Administration, University of Texas at Dallas, P.O. Box 688, Richardson, TX 75080, U.S.A. |
| Abstract: | Degeneracy checking in linear programming is NP-complete. So is the problem of checking whether there exists a basic feasible solution with a specified objective value. |
| Keywords: | Degeneracy testing linear programming NP-complete linear dependence |
| 本文献已被 ScienceDirect 等数据库收录！ | |