Local completeness and Pareto optimization

  • Bosch C
  • Garcia A
  • 3


    Mendeley users who have this article in their library.
  • 2


    Citations of this article.


In this paper we study the Pareto optimization problem in the framework of locally convex spaces with the restricted assumption that only some related sets are locally complete. © 2010 Elsevier Ltd. All rights reserved.

Author-supplied keywords

  • Critical points
  • Dynamical system
  • Efficiency points
  • Locally complete subset
  • Locally lower semicontinuity

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • C. Bosch

  • A. Garcia

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free