Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. U...Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.展开更多
This paper proposes the concepts of generalized αk-major efficient solutions and generalized αk- major optimal solutions for multi-objective programming, and studies their some important properties.
In this paper, we investigate the connectedness of G-proper efficient solution set for multiobjective programming problem. It is shown that the G-proper efficient solution set is connected if objective functions are c...In this paper, we investigate the connectedness of G-proper efficient solution set for multiobjective programming problem. It is shown that the G-proper efficient solution set is connected if objective functions are convex. A sufficient condition for the connectedness of G-proper efficient solution set is established when objective functions are strictly quasiconvex.展开更多
In this paper, we introduce a concept of quasi C-lower semicontinuity for setvalued mapping and provide a vector version of Ekeland＇s theorem related to set-valued vector equilibrium problems. As applications, we der...In this paper, we introduce a concept of quasi C-lower semicontinuity for setvalued mapping and provide a vector version of Ekeland＇s theorem related to set-valued vector equilibrium problems. As applications, we derive an existence theorem of weakly efficient solution for set-valued vector equilibrium problems without the assumption of convexity of the constraint set and the assumptions of convexity and monotonicity of the set-valued mapping. We also obtain an existence theorem of ε-approximate solution for set-valued vector equilibrium problems without the assumptions of compactness and convexity of the constraint set.展开更多
In this paper, stability results of solution mappings to perturbed vector generalized system are studied. Firstly, without the assumption of monotonicity, the Painleve-Kuratowski convergence of global efficient soluti...In this paper, stability results of solution mappings to perturbed vector generalized system are studied. Firstly, without the assumption of monotonicity, the Painleve-Kuratowski convergence of global efficient solution sets of a family of perturbed problems to the corresponding global efficient solution set of the generalized system is obtained, where the perturbations are performed on both the objective function and the feasible set. Then, the density and Painleve-Kuratowski convergence results of efficient solution sets are established by using gamma convergence, which is weaker than the assumption of continuous convergence. These results extend and improve the recent ones in the literature.展开更多
文摘Several equivalent statements of generalized subconvexlike set-valued map are established in ordered linear spaces. Using vector closure, we introduce Benson proper efficient solution of vector optimization problem. Under the assumption of generalized subconvexlikeness, scalarization, multiplier and saddle point theorems are obtained in the sense of Benson proper efficiency.
文摘This paper proposes the concepts of generalized αk-major efficient solutions and generalized αk- major optimal solutions for multi-objective programming, and studies their some important properties.
基金This work is supported by Research Foundation of the Education Departm entof Zhejiang Province(2 0 0 10 2 80 )
文摘In this paper, we investigate the connectedness of G-proper efficient solution set for multiobjective programming problem. It is shown that the G-proper efficient solution set is connected if objective functions are convex. A sufficient condition for the connectedness of G-proper efficient solution set is established when objective functions are strictly quasiconvex.
基金supported by the National Natural Science Foundation of China (11061023)
文摘In this paper, we introduce a concept of quasi C-lower semicontinuity for setvalued mapping and provide a vector version of Ekeland＇s theorem related to set-valued vector equilibrium problems. As applications, we derive an existence theorem of weakly efficient solution for set-valued vector equilibrium problems without the assumption of convexity of the constraint set and the assumptions of convexity and monotonicity of the set-valued mapping. We also obtain an existence theorem of ε-approximate solution for set-valued vector equilibrium problems without the assumptions of compactness and convexity of the constraint set.
基金Supported by the National Natural Science Foundation of China(No.11431004.11471059.11401058)the Basic and Advanced Research Project of Chongqing(cstc2017jcyj AX0382,cstc2015shmszx30004)+1 种基金the Program for University Innovation Team of Chongqing(CXTDX201601022)the Education Committee Project Foundation of Bayu Scholar
文摘In this paper, stability results of solution mappings to perturbed vector generalized system are studied. Firstly, without the assumption of monotonicity, the Painleve-Kuratowski convergence of global efficient solution sets of a family of perturbed problems to the corresponding global efficient solution set of the generalized system is obtained, where the perturbations are performed on both the objective function and the feasible set. Then, the density and Painleve-Kuratowski convergence results of efficient solution sets are established by using gamma convergence, which is weaker than the assumption of continuous convergence. These results extend and improve the recent ones in the literature.
