Skip to main content
SpringerLink
Log in

Least distance methods for the scheme of polytopes

  • Published:
Mathematical Programming Submit manuscript

Abstract

Methods are described and APL-codes are supplied to find vertices, edges, other faces and facets of polytopes given by point sets. The basic subroutine is a simplicial decomposition version of least distance, i.e. quadratic, programming. Computational experience indicates high efficiency.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M.L. Balinski, “An algorithm for finding all vertices of convex polyhedral sets”,Journal of the Society for Industrial and Applied Mathematics 9 (1961) 72–88.

    Google Scholar 

  2. C.A. Burdet, “Generating all faces of a polyhedron”,SIAM Journal on Applied Mathematics 26 (3) (1974) 479–489.

    Google Scholar 

  3. A. Charnes, “Optimality and degeneracy in linear programming”,Econometrica 20 (1952) 160–170.

    Google Scholar 

  4. D.R. Chand and S.S. Kapur, “An algorithm for convex polytopes”,Journal of the Association for Computing Machinery 17 (1970) 78–86.

    Google Scholar 

  5. B.L. Clarke, “Stability of the Bromate-Cerium-Malonic acid network: I Theoretical formulation, II Steady state formic acid case”,Journal of Chemical Physics 64 (10) (1976) 4165–4191.

    Google Scholar 

  6. M.J. Farrell and M. Fieldhouse, “Estimating efficient production functions under increasing returns to scale”,Journal of the Royal Statistical Society Ser. A 125 (II) (1962) 252–267.

    Google Scholar 

  7. B. Gruenbaum,Convex polytopes (John Wiley, New York 1967).

    Google Scholar 

  8. G. Hadley, Linear programming (Addison Wesley, Reading, MA, 1962).

    Google Scholar 

  9. D.A. Kohler, “Projections of convex polyhedral sets”, Rept. from Operations Research Center, Univ. Calif. Berkeley (August 1967).

  10. M. Maňas, “Methods for finding all vertices of a convex polyhedron” (Czech),Ekonom.-Mat. Obzor 5 (1969) 325–342.

    Google Scholar 

  11. M. Maňas and J. Nedoma, “Finding all vertices of a convex polyhedron”,Numerische Mathematik 12 (1968) 226–229.

    Google Scholar 

  12. I.H. Matheiss, “An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities”,Operations Research 21 (1973) 247–260.

    Google Scholar 

  13. P. McMullen and G.C. Shephard,Convex polytopes and the upper bound conjecture (Cambridge Univ. Press, London, 1971).

    Google Scholar 

  14. W.B. McRae and E.R. Davidson, “An algorithm for the extreme rays of a pointed convex polyhedral cone”, to appear.

  15. I.S. Motzkin, H. Raiffa, G. Thompson and R. Thrall, “The double description method”, in:Contributions to the theory of games II, Ann. of Math. Studies No. 28 (Princeton Univ. Press, Princeton, NJ, 1953) pp. 51–73.

    Google Scholar 

  16. E. Ya Pemez and A.S. Shteinberg, “On a theorem on convex polyhedra in relation to the problem of finding the set of solutions of a system of linear inequalities” (Russian),Ukrainskii matematicheskii zhurnal 19 (1967) 74–89.

    Google Scholar 

  17. J.D. Pryce, “Another algorithm for computing all vertices of a convex polyhedron”, unpublished typescript (April 1969).

  18. R. Schachtman, “Generation of the admissible boundary of a convex polytope”, Rept. from Dept. of Statistics, Univ. of North Carolina, (Feb. 1971).

  19. G.L. Thompson, F.M. Tonge and S. Zionts, “Techniques for removing non-binding constraints and extraneous variables from linear programming problems”,Management Science 12 (1965) 588–608.

    Google Scholar 

  20. B. Von Hohenbalken, “Finding faces of polytopes by simplicial decomposition; Part I: Vertices and edges” Research Paper Series, No. 24, Dept. of Economics, Univ. of Alberta (1975).

  21. B. Von Hohenbalken, “Finding faces of polytopes by simplicial decomposition; Part II: Higher-dimensional faces” Research Paper Series, No. 25, Dept. of Economics, Univ. of Alberta (1975).

  22. B. Von Hohenbalken, “A finite algorithm to maximize certain pseudoconcave functions on polytopes”Mathematical Programming 8 (1975) 189–206.

    Google Scholar 

  23. B. Von Hohenbalken, “Simplicial decomposition in nonlinear programming algorithms”,Mathematical Programming 13 (1977) 49–68.

    Google Scholar 

  24. R.J.B. Wets and C. Witzgall, “Algorithms for frames and lineality spaces of cones”,Journal of Research of the National Bureau of Standards—B. 71B (1967) 1–7.

    Google Scholar 

  25. P. Wolfe, “Finding the nearest point in a polytope”Mathematical Programming 11 (1976) 128–149.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Alberta, Edmonton, Alberta, Canada

    B. Von Hohenbalken

Authors
  1. B. Von Hohenbalken
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Von Hohenbalken, B. Least distance methods for the scheme of polytopes. Mathematical Programming 15, 1–11 (1978). https://doi.org/10.1007/BF01608995

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation