The Image Containment Problem and Some Classes of Polynomial Instances
Abstract
The image containment problem (ICP) is a minimum cost design problem concerning the containment of particular polyhedra, called zonotopes, that are images of boxes through linear transformations. The ICP is NP‐hard. Here we study a family of nontrivial ICP instances, called worst case demand (WCD) instances. We prove that such instances can be recognized and solved in polynomial time via linear programming. Then we characterize the classes of instances that are WCD independently on the choice of the cost vector (structurally worst case demand classes (SWCD)) and we show that recognizing whether a class of instances is SWCD is a coNP‐complete problem. Finally, we describe two families of SWCD classes that are interesting from an applicative point of view: the classes defined by the incidence matrices of particular directed graphs and those defined by pre‐Leontief matrices.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Prentice–Hall, Englewood Cliffs, NJ, 1993.
2.
A. Berman and R. J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, Academic Press, New York, 1979.
3.
F. Blanchini, F. Rinaldi, and W. Ukovich, A network design problem for a distribution system with uncertain demands, SIAM J. Optim., 7 (1997), pp. 560–578.
4.
F. Blanchini, F. Rinaldi, and W. Ukovich, Least inventory control of multi‐storage systems with non‐stochastic unknown input, IEEE Trans. Robotics and Automation, 13 (1997), pp. 633–645.
5.
R. Cambini, G. Gallo, and M. G. Scutellà, Flows on hypergraphs, Math. Programming, 78 (1997), pp. 195–217.
6.
S. Fortune, J. Hopcroft, and J. Wyllie, The directed graph homeomorphism problem, Theoret. Comput. Sci., 10 (1980), pp. 111–121.
7.
P. Gritzmann and V. Klee, On the complexity of some basic problems in computational convexity: I. Containment problems, Discrete Math., 136 (1994), pp. 129–174.
8.
M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer‐Verlag, Berlin, 1988.
9.
B. Grünbaum, Convex Polytopes, Springer‐Verlag, New York, 2003.
10.
L. J. Guibas, A. Nguyen, and L. Zhang, Zonotopes as bounding volumes, in Proceedings of the 14th Annual ACM–SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003, pp. 803–312.
11.
R. G. Jeroslow, K. Martin, R. L. Rardin, and J. Wang, Gainfree Leontief substitution flow problems, Math. Programming, 57 (1992), pp. 375–414.
12.
G. J. Koehler, A. B. Whinston, and G. P. Wright, Optimization over Leontief Substitution Systems, North–Holland, Amsterdam, 1975.
13.
S. T. McCormick, Submodular containment is hard, even for networks, Oper. Res. Lett., 19 (1996), pp. 95–99.
14.
P. McMullen, On zonotopes, Trans. Amer. Math. Soc., 159 (1971), pp. 91–109.
15.
R. Pesenti, F. Rinaldi, and W. Ukovich, An exact algorithm for the solution of a network design problem, Networks, 43 (2004), pp. 87–102.
16.
M. Svetoslav and C. Dalcidio, On the approximation of the centered zonotopes in the plane, in Proceedings of the 4th International Conference on Large Scale Scientific Computing 2003, Lecture Notes in Comput. Sci. 2907, Springer‐Verlag, Berlin, 2004, pp. 246–253.
17.
A. F. Veinott, Extreme points of Leontief substitution systems, Linear Algebra Appl., 1 (1968), pp. 181–194.
18.
G. M. Ziegler, Lectures on Polytopes, Springer‐Verlag, New York, 1995.
Information & Authors
Information
Published In
Copyright
Copyright © 2006 Society for Industrial and Applied Mathematics.
History
Submitted: 16 April 2004
Accepted: 12 June 2006
Published online: 26 December 2006
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
There are no citations for this item
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].