Skip to main content
Log in

An analytical expression and an algorithm for the volume of a convex polyhedron inR n

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

An analytical expression for the volume of the convex polyhedron {x¦Axb} is given. Based on a simple recursive identity, it yields an efficient algorithm. Redundant constraints can be detected.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Cohen, J., andHickey, T.,Two Algorithms for Determining Volumes of Convex Polyhedra, Journal of ACM, Vol. 26, No. 3, 1979.

  2. Merkhofer, M. W.,The Value of Information Given Decision Flexibility, Management Science, Vol. 23, No. 7, 1977.

  3. 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.

    Google Scholar 

  4. Grunbaum, B.,Convex Polytopes, Urley, New York, New York, 1967.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. Berger, M.,Geométrie, Volume 3, Polyèdres Convexes et Polytopes, Polyèdres Réguliers, Aires et Volumes, Nathan, Paris, France, 1978.

    Google Scholar 

  7. Dantzig, G. B.,Linear Programming and Extension, Princeton University Press, Princeton, New Jersey, 1963.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by P. Varaiya

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00934543

Key Words

Navigation