Skip to main content

Optimization on Directionally Convex Sets

  • Conference paper
Book cover Operations Research Proceedings 2002

Part of the book series: Operations Research Proceedings 2002 ((ORP,volume 2002))

  • 431 Accesses

Abstract

Directional convexity generalizes the concept of classical convexity. We investigate aC-convexity generated by the intersections of C-semispaces that efficiently approximates directional convexity. We consider the following optimization problem in case of the direction set of aC-convexity being infinite. Given a compact aC-convex set A, maximize a linear form L subject to A. We prove that there exists an aC-extreme solution of the problem. A Krein-Milman type theorem has been proved for aC-convexity. We show that the aC-convex hull of a finite point set represents the union of a finite set of polytopes in case of the direction set being finite.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wood, D. (1985) Computational Geometry jed. G.T. Toussant. North-Holland, Amsterdam 358

    Google Scholar 

  2. Metelskii, N.N., Martynchik, V.N. (1996) Directional convexity. Matematicheskie zametki. 60, 406–413 (in Russian)

    Google Scholar 

  3. Metelskii, N.N., Naidenko, V.G. (1999) Directionally convex hulls in B“, Vesti Natsionalnoi Akademii nauk Belarusi. Seriya fiz.-mat. nauk. 4, 39–42 (in Russian)

    Google Scholar 

  4. Metelskii, N.N., Naidenko, V.G. (2000) On a class of directionally convex semispaces. Vesti Natsionalnoi akademii nauk Belarusi. Seriya fiz.-mat. nauk. 1,56–59 (in Russian)

    Google Scholar 

  5. Naidenko V.G. (2000) Directionally convex set and its application to an optimization problem. Proc. Int. WorkshopDiscrete Optimization Methods in Scheduling and Computer-Aided Design, Minsk, Republic of Belarus, September 5–6. Institute of Engineering Cybernetics, Minsk, 5–6.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Naidenko, V. (2003). Optimization on Directionally Convex Sets. In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55537-4_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00387-8

  • Online ISBN: 978-3-642-55537-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics