Vector optimization using improvement sets in locally convex spaces

DOI10.1007/S40096-018-0256-2zbMath1417.90134OpenAlexW2885910898WikidataQ129429572 ScholiaQ129429572MaRDI QIDQ1991999

Mahboubeh Rezaei, Malek Abbasi

Publication date: 2 November 2018

Published in: Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40096-018-0256-2

zbMATH Keywords

vector optimizationKKM theoremimprovement setsPainlevé-Kuratowski set-convergence

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48) Methods involving semicontinuity and convergence; relaxation (49J45)

Cites Work

• Unnamed Item
• Stability and scalarization in vector optimization using improvement sets
• Vector optimization problems via improvement sets
• Nonconvex scalarization in set optimization with set-valued maps
• New proof of a theorem of F. Giannessi
• Theorems of the alternative and optimality conditions
• Stability and scalarization of weak efficient, efficient and Henig proper efficient sets using generalized quasiconvexities
• Stability for properly quasiconvex vector optimization problem
• Improvement sets and vector optimization
• Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
• Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
• Variational Analysis
• Stability for convex vector optimization problems

This page was built for publication: Vector optimization using improvement sets in locally convex spaces