Abstract
A nonempty closed convex polyhedronX can be represented either asX = {x: Ax ⩽b}, where (A, b) are given, in which caseX is called anH-cell, or in the formX = {x: x = Uλ + Vμ, Σλ j = 1,λ ⩾ 0,μ ⩾ 0}, where (U, V) are given, in which caseX is called aW-cell. This note discusses the computational complexity of certain set containment problems. The problems of determining if\(X \nsubseteq Y\), where (i)X is anH-cell andY is a closed solid ball, (ii)X is anH-cell andY is aW-cell, or (iii)X is a closed solid ball andY is aW-cell, are all shown to be NP-complete, essentially verifying a conjecture of Eaves and Freund. Furthermore, the problem of determining whether there exists an integer point in aW-cell is shown to be NP-complete, demonstrating that regardless of the representation ofX as anH-cell orW-cell, this integer containment problem is NP-complete.
Similar content being viewed by others
References
B.C. Eaves and R.M. Freund, “Optimal scaling of balls and polyhedra”,Mathematical Programming 23 (1982) 138–147.
F.R. Gantmacher,Matrix theory, vol. 1 (Chelsea, New York, 1959).
M.R. Garey and D.S. Johnson,Computers and intractability (W.H. Freeman, San Francisco, 1979).
R.M. Karp, “Reducibility among combinatorial problems”, in: R.E. Miller and J.W. Thatcher, eds.,Complexity of computer computations (Plenum Press, New York, 1972) pp. 85–103.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Freund, R.M., Orlin, J.B. On the complexity of four polyhedral set containment problems. Mathematical Programming 33, 139–145 (1985). https://doi.org/10.1007/BF01582241
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582241