Some NP-complete problems in linear programming

Authors:
R. Chandrasekaran;Santosh N. Kabadi;Katta G. Murthy
Affiliations:
School of Management and Administration, University of Texas at Dallas, P.O. Box 688, Richardson, TX 75080, U.S.A.;School of Management and Administration, University of Texas at Dallas, P.O. Box 688, Richardson, TX 75080, U.S.A.;School of Management and Administration, University of Texas at Dallas, P.O. Box 688, Richardson, TX 75080, U.S.A.
Venue:
Operations Research Letters
Year:
1982

Citing 1
Cited 4

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Nonlinear bipartite matching

Discrete Optimization
On the ε-perturbation method for avoiding degeneracy

Operations Research Letters
Note: On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix

Theoretical Computer Science
Reoptimization of the minimum total flow-time scheduling problem

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.