Local completeness and Pareto optimization

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Bosch, C., & Garcia, A. (2010). Local completeness and Pareto optimization. Nonlinear Analysis, Theory, Methods and Applications, 73(4), 1098–1100. https://doi.org/10.1016/j.na.2010.04.044

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free