Skip to main content

Optimality of the Methods for Approximating the Feasible Criterion Set in the Convex Case

  • Conference paper
Book cover Multiobjective Programming and Goal Programming

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 618))

  • 2053 Accesses

Abstract

Estimation Refinement (ER) is an adaptive method for polyhedral approximations of multidimensional convex sets. ER is used in the framework of the Interactive Decision Maps (IDM) technique that provides interactive visualization of the Pareto frontier for convex sets of feasible criteria vectors. We state that, for ER, the number of facets of approximating polytopes is asymptotically multinomial of an optimal order. Furthermore, the number of support function calculations, needed to be resolved during the approximation, and which complexity is unknown beforehand since a user of IDM provides his own optimization algorithm, is bounded from above by a linear function of the number of iterations.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brooks LN, Strantzen JB (1989) Blaschke's rolling theorem in Rn. Mem Am Math Soc 80(405):2–5

    Google Scholar 

  2. Burmistrova LV, Efremov RV, Lotov AV (2002) A decision-making visual support technique and its application in water resources management systems. J Comput Syst Sci Int 41(5):759– 769

    Google Scholar 

  3. Bushenkov VA, Lotov AV (1982) Methods for the construction and application of generalized reachable sets. Technical report, Computing Center of the USSR Academy of Sciences, Moscow (In Russian)

    Google Scholar 

  4. Chernykh OL (1988) Construction of the convex hull of a finite set of points when the computations are approximate. Comput Math Math Phys 28(5):71–77

    Article  Google Scholar 

  5. Chernykh OL (1995) Approximation of the Pareto-hull of a convex set by polyhedral sets. Comput Math Math Phys 35(8):1033–1039

    Google Scholar 

  6. Efremov R, Rios Insua D, Lotov A (2006) A framework for Participatory group decision support over the web based on Pareto frontier visualization, goal identification and arbitration. Technical reports on statistics and decision sciences, Rey Juan Carlos University, Madrid, Spain

    Google Scholar 

  7. Efremov RV, Kamenev GK (2002) An a priori estimate for the asymptotic efficiency of a class of algorithms for the polyhedral approximation of convex bodies. Comput Math Math Phys 42(1):20–29

    Google Scholar 

  8. Efremov RV, Kamenev GK (2008) Optimal estimate of the growth order of the number of facets in one class of the methods for polyhedral approximation. Comput Math Math Phys

    Google Scholar 

  9. Kamenev GK (1992) A class of adaptive algorithms for the approximation of bodies by polyhedra. Comput Math Math Phys 32(1):114–127

    Google Scholar 

  10. Kamenev GK (1994) Investigation of an algorithm for the approximation of convex bodies. Comput Math Math Phys 34(4):521–528

    Google Scholar 

  11. Lotov A, Kistanov A, Zaitsev A (2004) Visualization-based data mining tool and its web application. In: Shi Y, Xu W, Chen Z (eds) Data mining and knowledge management, LNAI vol 3327. Springer, Berlin, Heidelberg, pp 1–10

    Google Scholar 

  12. Lotov AV, Bourmistrova LV, Efremov RV, Bushenkov VA, Buber AL, Brainin NA (2005) Experience of model integration and Pareto frontier visualization in the search for preferable water quality strategies. Environ Model Software 20(2):243–260

    Article  Google Scholar 

  13. Lotov AV, Bushenkov VA, Kamenev GK (2004) Interactive Decision Maps. Approximation and Visualization of Pareto Frontier. Kluwer, Boston

    Google Scholar 

  14. Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Spinger, New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Efremov, R., Kamenev, G. (2009). Optimality of the Methods for Approximating the Feasible Criterion Set in the Convex Case. In: Barichard, V., Ehrgott, M., Gandibleux, X., T'Kindt, V. (eds) Multiobjective Programming and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol 618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85646-7_3

Download citation

Publish with us

Policies and ethics