Extended Well-Posedness Properties of Vector Optimization Problems

In this paper, the concept of extended well-posedness of scalar optimization problems introduced by Zolezzi is generalized to vector optimization problems in three ways: weakly extended well-posedness, extended well-posedness, and strongly extended well-posedness. Criteria and characterizations of the three types of extended well-posedness are established, generalizing most of the results obtained by Zolezzi for scalar optimization problems. Finally, a stronger vector variational principle and Palais-Smale type conditions are used to derive sufficient conditions for the three types of extended well-posedness.     

Pointwise Well-Posedness of Perturbed Vector Optimization Problems in a Vector-Valued Variational Principle

In this note, we point out and correct some errors in Ref. 1. Another type of pointwise well-posedness and strong pointwise well-posedness of vector optimization problems is introduced. Sufficient conditions to guarantee this type of well-posedness are provided for perturbed vector optimization problems in connection with the vector-valued Ekeland variational principle.     

Well-posedness and convexity in vector optimization

We study a notion of well-posedness in vector optimization through the behaviour of minimizing sequences of sets, defined in terms of Hausdorff set-convergence. We show that the notion of strict efficiency is related to the notion of well-posedness. Using the obtained results we identify a class of well-posed vector optimization problems: the convex problems with compact efficient frontiers.     

Well-posedness and stability in vector optimization problems using Henig proper efficiency

In this article, we study well-posedness and stability aspects for vector optimization in terms of minimizing sequences defined using the notion of Henig proper efficiency. We justify the importance of set convergence in the study of well-posedness of vector problems by establishing characterization of well-posedness in terms of upper Hausdorff convergence of a minimizing sequence of sets to the set of Henig proper efficient solutions. Under certain compactness assumptions, a convex vector optimization problem is shown to be well-posed. Finally, the stability of vector optimization is discussed by considering a perturbed problem with the objective function being continuous. By assuming the upper semicontinuity of certain set-valued maps associated with the perturbed problem, we establish the upper semicontinuity of the solution map.     

Scalarization method for Levitin–Polyak well-posedness of vectorial optimization problems

In this paper, we develop a method of study of Levitin?CPolyak well-posedness notions for vector valued optimization problems using a class of scalar optimization problems. We first introduce a non-linear scalarization function and consider its corresponding properties. We also introduce the Furi?CVignoli type measure and Dontchev?CZolezzi type measure to scalar optimization problems and vectorial optimization problems, respectively. Finally, we construct the equivalence relations between the Levitin?CPolyak well-posedness of scalar optimization problems and the vectorial optimization problems.     

Generalized Hadamard well-posedness for infinite vector optimization problems

In this paper, we study the generalized Hadamard well-posedness of infinite vector optimization problems (IVOP). Without the assumption of continuity with respect to the first variable, the upper semicontinuity and closedness of constraint set mappings are established. Under weaker assumptions, sufficient conditions of generalized Hadamard well-posedness for IVOP are obtained under perturbations of both the objective function and the constraint set. We apply our results to the semi-infinite vector optimization problem and the semi-infinite multi-objective optimization problem.     

On Well-Posedness and Hausdorff Convergence of Solution Sets of Vector Optimization Problems

In this paper, we refine and improve the results established in a 2003 paper by Deng in a number of directions. Specifically, we establish a well-posedness result for convex vector optimization problems under a condition which is weaker than that used in the paper. Among other things, we also obtain a characterization of well-posedness in terms of Hausdorff distance of associated sets.     

Well-Posedness and Scalarization in Vector Optimization

In this paper, we study several existing notions of well- posedness for vector optimization problems. We separate them into two classes and we establish the hierarchical structure of their relationships. Moreover, we relate vector well-posedness and well-posedness of an appropriate scalarization. This approach allows us to show that, under some compactness assumption, quasiconvex problems are well posed.The authors thank Professor C. Zălinescu for pointing out some inaccuracies in Ref. 11. His remarks allowed the authors to improve the present work.     

Levitin–Polyak well-posedness of vector equilibrium problems

In this paper, two types of Levitin–Polyak well-posedness of vector equilibrium problems with variable domination structures are investigated. Criteria and characterizations for two types of Levitin–Polyak well-posedness of vector equilibrium problems are shown. Moreover, by virtue of a gap function for vector equilibrium problems, the equivalent relations between the Levitin–Polyak well-posedness for an optimization problem and the Levitin–Polyak well-posedness for a vector equilibrium problem are obtained. This research was partially supported by the National Natural Science Foundation of China (Grant number: 60574073) and Natural Science Foundation Project of CQ CSTC (Grant number: 2007BB6117).     

Scalarization and pointwise well-posedness in vector optimization problems

The aim of this paper is applying the scalarization technique to study some properties of the vector optimization problems under variable domination structure. We first introduce a nonlinear scalarization function of the vector-valued map and then study the relationships between the vector optimization problems under variable domination structure and its scalarized optimization problems. Moreover, we give the notions of DH-well-posedness and B-well-posedness under variable domination structure and prove that there exists a class of scalar problems whose well-posedness properties are equivalent to that of the original vector optimization problem.     

The generalized Tykhonov well-posedness for system of vector quasi-equilibrium problems

In this paper, the notion of the generalized Tykhonov well-posedness for system of vector quasi-equilibrium problems are investigated. By using the gap functions of the system of vector quasi-equilibrium problems, we establish the equivalent relationship between the generalized Tykhonov well-posedness of the system of vector quasi-equilibrium problems and that of the minimization problems. We also present some metric characterizations for the generalized Tykhonov well-posedness of the system of vector quasi-equilibrium problems. The results in this paper are new and extend some known results in the literature.     

Well-posedness for general parametric quasi-variational inclusion problems

In this paper, we aim to suggest the new concept of well-posedness for the general parametric quasi-variational inclusion problems (QVIP). The corresponding concepts of well-posedness in the generalized sense are also introduced and investigated for QVIP. Some metric characterizations of well-posedness for QVIP are given. We prove that under suitable conditions, the well-posedness is equivalent to the existence of uniqueness of solutions. As applications, we obtain immediately some results of well-posedness for the parametric quasi-variational inclusion problems, parametric vector quasi-equilibrium problems and parametric quasi-equilibrium problems.     

Kuratowski convergence of the efficient sets in the parametric linear vector semi-infinite optimization

In the space of whole linear vector semi-infinite optimization problems we consider the mappings putting into correspondence to each problem the set of efficient and weakly efficient points, respectively. We endow the image space with Kuratowski convergence and by means of the lower and upper semi-continuity of these mappings we prove generic well-posedness of the vector optimization problems. The connection between the continuity and some properties of the efficient sets is also discussed.     

Hadamard well-posed vector optimization problems

In this paper, two kinds of Hadamard well-posedness for vector-valued optimization problems are introduced. By virtue of scalarization functions, the scalarization theorems of convergence for sequences of vector-valued functions are established. Then, sufficient conditions of Hadamard well-posedness for vector optimization problems are obtained by using the scalarization theorems.     

Levitin–Polyak well-posedness in set optimization concerning Pareto efficiency

This article aims to elaborate on various notions of Levitin–Polyak well-posedness for set optimization problems concerning Pareto efficient solutions. These notions are categorized into two classes including pointwise and global Levitin–Polyak well-posedness. We give various characterizations of both pointwise and global Levitin–Polyak well-posedness notions for set optimization problems. The hierarchical structure of their relationships is also established. Under suitable conditions on the input data of set optimization problems, we investigate the closedness of Pareto efficient solution sets in which they are different from the weakly efficient ones. Furthermore, we provide sufficient conditions for global Levitin–Polyak well-posedness properties of the reference problems without imposing the information on efficient solution sets.

     

Levitin–Polyak Well-Posedness for Optimization Problems with Generalized Equilibrium Constraints

In this paper, we consider Levitin–Polyak well-posedness of parametric generalized equilibrium problems and optimization problems with generalized equilibrium constraints. Some criteria for these types of well-posedness are derived. In particular, under certain conditions, we show that generalized Levitin–Polyak well-posedness of a parametric generalized equilibrium problem is equivalent to the nonemptiness and compactness of its solution set. Finally, for an optimization problem with generalized equilibrium constraints, we also obtain that, under certain conditions, Levitin–Polyak well-posedness in the generalized sense is equivalent to the nonemptiness and compactness of its solution set.     

Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems

In this paper, we first derive several characterizations of the nonemptiness and compactness for the solution set of a convex scalar set-valued optimization problem (with or without cone constraints) in which the decision space is finite-dimensional. The characterizations are expressed in terms of the coercivity of some scalar set-valued maps and the well-posedness of the set-valued optimization problem, respectively. Then we investigate characterizations of the nonemptiness and compactness for the weakly efficient solution set of a convex vector set-valued optimization problem (with or without cone constraints) in which the objective space is a normed space ordered by a nontrivial, closed and convex cone with nonempty interior and the decision space is finite-dimensional. We establish that the nonemptiness and compactness for the weakly efficient solution set of a convex vector set-valued optimization problem (with or without cone constraints) can be exactly characterized as those of a family of linearly scalarized convex set-valued optimization problems and the well-posedness of the original problem.     

Well-posedness for parametric optimization problems with variational inclusion constraint

In this paper, we study the well-posedness for the parametric optimization problems with variational inclusion problems as constraint (or the perturbed problem of optimization problems with constraint). Furthermore, we consider the relation between the well-posedness for the parametric optimization problems with variational inclusion problems as constraint and the well-posedness in the generalized sense for variational inclusion problems.     

关于良定问题

本文应用有限理性模型M,对非线性问题的良定性进行了统一的研究,对最优化、多目标最优化、非合作博弈和广义博弈得到了一些新的良定性结果.