Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints

TL;DR

This paper investigates the existence of Pareto solutions in vector polynomial optimization problems with constraints, utilizing semi-algebraic geometry tools to establish conditions ensuring solutions exist.

Contribution

It introduces the concept of tangency varieties and links various geometric and variational conditions to establish Pareto solution existence.

Findings

Provided sufficient conditions for Pareto solutions existence.

Connected Palais–Smale, Cerami, M-tameness, and properness conditions.

Illustrated results with concrete examples.

Abstract

In this paper, we are interested in the existence of Pareto solutions to vector polynomial optimization problems over a basic closed semi-algebraic set. By invoking some powerful tools from real semi-algebraic geometry, we first introduce the concept called {\it tangency varieties}; then we establish connections of the Palais--Smale condition, Cerami condition, {\it M}-tameness, and properness related to the considered problem, in which the condition of Mangasarian--Fromovitz constraint qualification at infinity plays an essential role in deriving these connections. According to the obtained connections, we provide some sufficient conditions for existence of Pareto solutions to the problem in consideration, and we also give some examples to illustrate our main findings.