English

On the existence of Pareto solutions for polynomial vector optimization problems

Optimization and Control 2018-04-16 v3

Abstract

We are interested in the existence of Pareto solutions to the vector optimization problem MinR+m{f(x)xRn},\text{Min}_{\,\mathbb{R}^m_+} \{f(x) \,|\, x\in \mathbb{R}^n\}, where f ⁣:RnRmf\colon\mathbb{R}^n\to \mathbb{R}^m is a polynomial map. By using the {\em tangency variety} of ff we first construct a semi-algebraic set of dimension at most m1m - 1 containing the set of Pareto values of the problem. Then we establish connections between the Palais--Smale conditions, MM-tameness, and properness for the map ff. Based on these results, we provide some sufficient conditions for the existence of Pareto solutions of the problem. We also introduce a generic class of polynomial vector optimization problems having at least one Pareto solution.

Keywords

Cite

@article{arxiv.1611.07108,
  title  = {On the existence of Pareto solutions for polynomial vector optimization problems},
  author = {Do Sang Kim and Tien-Son Pham and Nguyen Van Tuyen},
  journal= {arXiv preprint arXiv:1611.07108},
  year   = {2018}
}

Comments

21 pages

R2 v1 2026-06-22T17:00:07.257Z