-properly efficiency of multiobjective semidefinite programming with set-valued functions

DOI10.1155/2017/5978130MaRDI QIDQ1992929zbMATH OpenOpenAlexWikidataFDO

Authors Chunhong Yuan, Weidong Rong

Publication date 5 November 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2017/5978130

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)

Review text

Summary: In this paper, we study the \(\varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions. Firstly, we obtain the scalarization theorems under the condition of the generalized cone-subconvexlikeness. Then, we establish the alternative theorem which contains matrixes and vectors, the \(\varepsilon \)-Lagrange multiplier theorems, and the \(\varepsilon \)-proper saddle point theorems of the primal programming under some suitable conditions.

Recommendations

• scientific article; zbMATH DE number 6796429
• Benson proper efficiency of multiobjective semidefinite programming with set-valued maps
• The weak proper efficiency of multiobjective semidefinite programming with set-valued maps
• \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
• scientific article; zbMATH DE number 1500162

Cites work

• \(E\)-Benson proper efficiency in vector optimization
• A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization
• Benson proper efficiency in the vector optimization of set-valued maps
• Duality for vector optimization of set-valued functions
• e-weak minimal solutions of vector optimization problems with set-valued maps
• scientific article; zbMATH DE number 5926450 (Why is no real title available?)
• Near-subconvexlikeness in vector optimization with set-valued functions
• Optimality conditions for proper efficient solutions of vector set-valued optimization.
• Theory of multiobjective optimization
• Vector optimization problems via improvement sets
• Weak sharp minima for set-valued vector variational inequalities with an application

Cited in

(6)

• \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
• Benson proper efficiency of multiobjective semidefinite programming with set-valued maps
• The weak proper efficiency of multiobjective semidefinite programming with set-valued maps
• scientific article; zbMATH DE number 1500162 (Why is no real title available?)
• scientific article; zbMATH DE number 5018510 (Why is no real title available?)
• scientific article; zbMATH DE number 6796429 (Why is no real title available?)

This page was built for publication: \( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1992929)