Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
type: Item
instance of: scholarly article
title: Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
zbMATH Open document ID: 1267.90136
published in: Journal of Optimization Theory and Applications
publication date: 2013-02-11T00:00:00Z
review text: Autors' abstract: In real ordered linear spaces, an equivalent characterization of generalized cone subconvexlikeness of set-valued maps is firstly established. Secondly, under the assumption of generalized cone subconvexlikeness of set-valued maps, a scalarization theorem of set-valued optimization problems in the sense of \(\epsilon \)-weak efficiency is obtained. Finally, by a scalarization approach, an existence theorem of \(\epsilon \)-global properly efficient element of set-valued optimization problems is obtained. The results in this paper generalize and improve some known results in the literature.
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 6135497
zbMATH Keywords: set-valued map
zbMATH Keywords: convexlikeness
zbMATH Keywords: scalarization
author: Zhi-Ang Zhou
author: J. W. Peng
reviewed by: Antanas Žilinskas
MaRDI profile type: Publication
full work available at URL: s10957-012-0045-2
OpenAlex ID: W2023949084
cites work: Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
cites work: A theorem of the alternative and its application to the optimization of set-valued maps
cites work: Lagrangian duality for minimization of nonconvex multifunctions
cites work: Theorems of the alternative and optimization with set-valued maps
cites work: Near-subconvexlikeness in vector optimization with set-valued functions
cites work: New generalized convexity notion for set-valued maps and application to vector optimization
cites work: The optimality conditions for vector optimization of set-valued maps
cites work: Q5296433
cites work: Benson proper efficiency in the vector optimization of set-valued maps
cites work: Globally proper saddle point in ic-cone-convexlike set-valued optimization problems
cites work: Q3679784
cites work: Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
cites work: Vector Optimization
cites work: Scalarization in vector optimization
cites work: On the notion of proper efficiency in vector optimization
cites work: e-weak minimal solutions of vector optimization problems with set-valued maps
cites work: Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces
cites work: Q5489984
cites work: Lagrange multipliers and saddle points in multiobjective programming
cites work: Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions
cites work: Proper efficiency in vector optimization on real linear spaces.
DOI: 10.1007/S10957-012-0045-2
description: scientific article; zbMATH DE number 6135497