Skip to main content
SpringerLink
Log in
Book cover

Operations Research pp 13–22Cite as

On the Vertex Enumeration Problem in Cutting Plane Algorithms of Global Optimization

  • Chapter

Abstract

We consider the following vertex enumeration problem:

  1. (VE)

    Given a hyperplane H and a polytope P with known vertex set V(P) find the vertex set of the polytope \(\bar P = P \cap H\).

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bulatov, V.P.: Embedding Methods in Optimization Problems, Nauka, Novosibirsk 1977 (in Russian).

    Google Scholar 

  • Bulatov, V.P., and Kasinkaya, L.I.: Some Methods of Concave Minimization on a Convex Polyhedron and their Applications, in: Methods of Optimization and their Applications, Nauka, Novosibirsk 1982, pp. 71–80 (in Russian).

    Google Scholar 

  • Chen, P.C., Hansen, P., and Jaumard, B.: On-line and Off-line Vertex Enumeration by Adjacency Lists, Discussion Paper, Rutcor and Gerard, 1990.

    Google Scholar 

  • Dyer, M.E.: The Complexity of Vertex Enumeration Methods, in: Mathematics of Operations Research 8, 1983, pp. 381–402.

    Google Scholar 

  • Emelichev, V.A., and Kovalev, M.M.: Solving Certain Concave Programming Problems by Successive Approximation, in: Izvestya Akademii Nauk BSSR 6, 1970, pp. 27–34 (in Russian).

    Google Scholar 

  • Falk, J.E., and Hoffman, K.L.: A Successive Underestimation Method for Concave Minimization Problems, in: Mathematics of Operations Research 1, 1976, pp. 251–259.

    Google Scholar 

  • Falk, J.E., and Hoffman, K.L.: Concave Minimization via Collapsing Polytopes, in: Operations Research 34, 1986, pp. 919–926.

    Google Scholar 

  • Gal, T.: Determination of all Neighbours of a Degenerate Point in Polytopes, Working Paper 17b, Fernuniversität Hagen, Hagen 1978.

    Google Scholar 

  • Gal, T.: Postoptimal Analysis, Parametric Programming, and Related Topics, New York 1979.

    Google Scholar 

  • Gal, T.: On the Structure of the Set of Bases of a Degenerate Point, in: Journal of Optimization Theory and Applications 45, 1985, pp. 577–589.

    Article  Google Scholar 

  • Gal, T.: Shadow Prices and Sensivity Analysis in Linear Programming under Degeneracy - A State-of-the-Art Survey, in: Operations Research Spektrum 8, 1986, pp. 59–77.

    Article  Google Scholar 

  • Gal, T., Kruse, H.J., and Zörnig, P.: Survey and Solved and Open Problems in the Degeneracy Phenomenon, in: Mathematical Programming, Series B, 42, 1988, pp. 125–133.

    Article  Google Scholar 

  • Geue, F.: Eine Pivotauswahlregel und die durch sie induzierten Teilgraphen des positiven Entartungsgraphen, Working Paper No. 141, Fernuniversität Hagen, Hagen 1989.

    Google Scholar 

  • Glover, F.: Polyhedral Annexation in Mixed Integer and Combinatorial Programming, in: Mathematical Programming 8, 1975, pp. 161–188.

    Article  Google Scholar 

  • Hoffman, K.L.: A Method for Globally Minimizing Concave Functions over Convex Sets, in: Mathematical Programming 20, 1981, pp. 22–32.

    Article  Google Scholar 

  • Horst, R.: On the Global Minimization of Concave Functions: Introduction and Survey, in: Operations Research Spektrum 6, 1984, pp. 195–205.

    Article  Google Scholar 

  • Horst, R.: Deterministic Global Optimization: Some Recent Advances and New Fields of Application, in: Naval Research Logistics 37, 1990, pp. 433–471.

    Article  Google Scholar 

  • Horst, R., Thoai, N.V., and de Vries, J.: On Finding New Vertices and Redundant Constraints in Cutting Plane Algorithms for Global Optimization, in: Operations Research Letters 7, 1988, pp. 85–90.

    Article  Google Scholar 

  • Horst, R., Thoai, N.V., and Tuy, H.: Outer Approximation by Polyhedral Convex Sets, in: Operations Research Spektrum 9, 1987, pp. 153–159.

    Article  Google Scholar 

  • Horst, R., Thoai, N.V., and Tuy, H.: On an Outer Approximation Concept in Global Optimization, in: Optimization 20, 1989, pp. 255–264.

    Article  Google Scholar 

  • Horst, R., and Tuy, H.: Global Optimization - Deterministic Approaches, Berlin et al. 1990.

    Google Scholar 

  • Istomin, L.A.: A Modification of Tuy’s Method for Minimizing a Concave Function over a Polytope, in: USSR Computational Mathematics and Mathematical Physics 17, 1977, pp. 1582–1592 (in Russian).

    Article  Google Scholar 

  • Khang, D.B., and Fujiwara, O.: A New Algorithm to Find all Vertices over a Polytope, in: Operations Research Letters 8, 1989, pp. 261–264.

    Article  Google Scholar 

  • Knuth, D.E.: Searching and Sorting, The Art of Computer Programming, Volume 3, Addison- Wesley 1973.

    Google Scholar 

  • Kruse, H.J.: Degeneracy Graphs and the Neighbourhood Problem. Lecture Notes in Economics and Mathematical Systems No. 260, Berlin et al. 1986.

    Google Scholar 

  • Matheiss, T.H., and Rubin, D.S.: A Survey and Comparison of Methods for Finding all Vertices of Convex Polyhedral Sets, in: Mathematics of Operations Research 5, 1980, pp. 167–185.

    Article  Google Scholar 

  • Thach, P.T., and Tuy, H.: Global Optimization under Lipschitzian Constraints, in: Japan Journal of Applied Mathematics 4, 1987, pp. 205–217.

    Article  Google Scholar 

  • Thieu, T.V., Tam, B.T., and Ban, T.V.: An Outer Approximation Method for Globally Minimizing a Concave Function over a Compact Convex Set, in: Acta Mathematica Vietnamica 8, 1983, pp. 21–40.

    Google Scholar 

  • Thoai, N.V.: A Modified Version of Tuy’s Method for Solving D.C. Programming Problems, in: Optimization 19, 1988, pp. 665–674.

    Article  Google Scholar 

  • Tuy, H.: On Outer Approximation Methods for Solving Concave Minimization Problems, in: Acta Mathematica Vietnamica 8, 1983, pp. 3–34.

    Google Scholar 

  • Tuy, H.: On a Polyhedral Annexation Method for Concave Minimization, Preprint, Institute of Mathematics, Hanoi 1986.

    Google Scholar 

  • Tuy, H.: Convex Programs with an Additional Reverse Convex Constraint, in: Journal of Optimization Theory and Applications 52, 1987, pp. 463–485.

    Article  Google Scholar 

  • Tuy, H.: Polyhedral Underestimation Method for Concave Minimization, Preprint, Institute of Mathematics, Hanoi 1988.

    Google Scholar 

  • Tuy, H., and Thuong, N.V.: On the Global Minimization of a Convex Function under General Nonconvex Constraints, in: Applied Mathematics and Optimization 18, 1988, pp. 119–142.

    Article  Google Scholar 

  • Vaish, H., and Shetty, C.H.: The Bilinear Programming Problem, in: Naval Research Logistics Quarterly 23, 1976, pp. 303–309.

    Article  Google Scholar 

  • Zörnig, P.: Theorie der Entartungsgraphen und ihre Anwendung zur Erklärung der Simplexzyklen, Dissertation, Fernuniversität Hagen, Hagen 1989.

    Google Scholar 

Download references

Authors
  1. Reiner Horst
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Wirtschaftswissenschaft, FernUniversität Hagen, Feithstr. 140/ AVZ II, D-5800, Hagen 1, Germany

    Günter Fandel (Lehrstuhl für Produktion und Investition) (Lehrstuhl für Produktion und Investition)

  2. Fachbereich Wirtschaftswissenschaft, FernUniversität Hagen, Kleine Str. 22, D-5800, Hagen 1, Germany

    Hermann Gehring (Lehrstuhl für Wirtschaftsinformatik) (Lehrstuhl für Wirtschaftsinformatik)

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Horst, R. (1991). On the Vertex Enumeration Problem in Cutting Plane Algorithms of Global Optimization. In: Fandel, G., Gehring, H. (eds) Operations Research. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76537-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76537-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-76539-1

  • Online ISBN: 978-3-642-76537-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation