Local completeness and Pareto optimization
Article
-
- Overview
-
- Research
-
- Identity
-
- Additional Document Info
-
- View All
-
Overview
abstract
-
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.
publication date
published in
Research
keywords
-
Critical points; Dynamical system; Efficiency points; Locally complete subset; Locally lower semicontinuity Critical points; Locally convex spaces; Lower semi-continuity; Pareto optimization; Damping; Equations of state; Optimization; Dynamical systems
Identity
Digital Object Identifier (DOI)
Additional Document Info
start page
end page
volume
issue