Bounded Sets of KKT Multipliers in Vector Optimization

In this paper,we consider the multiobjective optimization problem that incorporates not only equality constraints but also inequality constraints.Mainly proves that under the assumption of the condition of basic regular vector optimization is a non-empty,bounded KKT true subset.We assume that the objective function and constraint functions are smooth.First of all,defines the basic regular condition of vector optimization.Secondly,proves the existence of constant optimization problem KKT multipUers.Finally,expand the constant optimization of vector optimization,proved in the basic conditions of regular and Pareto minimum or Pareto weak minimum case vector optimization of true KKT multipUers boundedness.