Abstract
The positive hull of a finite set of vectors, \({\cal V}\), in d-dimensional space may or may not contain a lineality space \({\cal L}\). This article presents an algorithm that identifies the vectors of \({\cal V}\) that belong to \({\cal L}\). This is done by means of a sequence of supporting hyperplanes because every supporting hyperplane of the positive hull of \({\cal V}\) contains \({\cal L}\). Computational results show the effectiveness of the algorithm, which is compared to the best procedure currently available (to the best knowledge of the author) that solves the same problem. The algorithm introduced here is especially efficient in the case of large problems, where cardinality and/or dimensions are large.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom. 8, 295–313 (1992)
Bonnice, W., Klee, V.L.: The generation of convex hulls. Math. Ann. 152, 1–29 (1963)
Davis, C.: Theory of positive linear dependence. Am. J. Math. 76, 733–746 (1954)
De Schutter, B., De Moor, B.: The extended linear complementarity problem. Math. Program. 71(3), 289–325 (1995)
De Schutter, B., De Moor, B.: Minimal realization in the max algebra is an extended linear complementarity problem. Syst. Control Lett. 25(2), 103–111 (1995)
Dulá, J.H.: Geometry of optimal value functions with applications to redundancy in linear programming. J. Optim. Theory Appl. 81(1), 35–52 (1994)
Dulá, J.H., Helgason, R.V., Venugopal, N.: An algorithm for identifying the frame of a pointed finite conical hull. INFORMS J. Comput. 10(3), 323–330 (1998)
Dulá, J.H., López, F.J.: Algorithms for the frame of a finitely generated unbounded polyhedron. INFORMS J. Comput. 18(1), 97–110 (2006)
Edmonds, J., Lovasz, L., Pulleyblank, R.: Brick decompositions and the matching rank of graphs. Cominatorica 2(3), 247–274 (1982)
Gritzmann, P., Klee, V., Tam, B.: Cross-positive matrices revisited. Linear Algebra Appl. 223/224, 285–305 (1995)
IMSL Stat Library: Application Development Tools. Visual Numerics, Inc., Houston (1994)
Motzkin, T.S., Raiffa, H., Thompson, L., Thrall, R.M.: The double description method. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games, vol. II. Princeton University Press, Princeton (1953)
Mulmuley, K.: Computational Geometry. An Introduction Through Randomized Algorithms. Prentice-Hall, Upper Saddle River (1994)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1998)
Wallace, S.W., Wets, R.J.-B.: Preprocessing in stochastic programming: the case of linear programs. ORSA J. Comput. 4, 45–59 (1992)
Wets, R.J.-B., Witzgall, C.: Algorithms for frames and lineality spaces of cones. J. Res. Natl. Bur. Stand., B Math. Math. Phys. 71B, 1–7 (1967)
Wets, R.J.-B., Witzgall, C.: Towards an algebraic characterization of convex polyhedral cones. Numer. Math. 12, 134–138 (1968)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
López, F.J. An Algorithm to Find the Lineality Space of the Positive Hull of a Set of Vectors. J Math Model Algor 10, 1–30 (2011). https://doi.org/10.1007/s10852-010-9133-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-010-9133-1