Abstract
An analytical expression for the volume of the convex polyhedron {x¦Ax⩽b} is given. Based on a simple recursive identity, it yields an efficient algorithm. Redundant constraints can be detected.
Similar content being viewed by others
References
Cohen, J., andHickey, T.,Two Algorithms for Determining Volumes of Convex Polyhedra, Journal of ACM, Vol. 26, No. 3, 1979.
Merkhofer, M. W.,The Value of Information Given Decision Flexibility, Management Science, Vol. 23, No. 7, 1977.
Mattheiss, T. H.,An Algorithm for Determining Irrelevant Constraints and All Vertices in Systems of Linear Inequalities, Operations Research, Vol. 21, pp. 247–260, 1973.
Grunbaum, B.,Convex Polytopes, Urley, New York, New York, 1967.
Mattheiss, T. H., andSchmidt, B. K.,Computational Results on an Algorithm for Finding All Vertices of a Polytope, Mathematical Programming, Vol. 18, pp. 308–329, 1980.
Berger, M.,Geométrie, Volume 3, Polyèdres Convexes et Polytopes, Polyèdres Réguliers, Aires et Volumes, Nathan, Paris, France, 1978.
Dantzig, G. B.,Linear Programming and Extension, Princeton University Press, Princeton, New Jersey, 1963.
Author information
Authors and Affiliations
Additional information
Communicated by P. Varaiya
Rights and permissions
About this article
Cite this article
Lasserre, J.B. An analytical expression and an algorithm for the volume of a convex polyhedron inR n . J Optim Theory Appl 39, 363–377 (1983). https://doi.org/10.1007/BF00934543
Issue Date:
DOI: https://doi.org/10.1007/BF00934543