Scalarizations for a set optimization problem using generalized oriented distance function

DOI10.1007/s11117-019-00659-3zbMath1428.90133OpenAlexW2918151341MaRDI QIDQ2329005

Khushboo, C. S. Lalitha

Publication date: 17 October 2019

Published in: Positivity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11117-019-00659-3

zbMATH Keywords

scalarizationset optimizationpartial order relationgeneralized oriented distance function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Related Items (15)

Some properties of generalized oriented distance function and their applications to set optimization problems ⋮ Characterizations of the set less order relation in nonconvex set optimization ⋮ Image space analysis for set optimization problems with applications ⋮ Convergence of the solution sets for set optimization problems ⋮ A set scalarization function and Dini directional derivatives with applications in set optimization problems ⋮ Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization ⋮ Characterizations of multi-objective robustness solutions defined by Minkowski set difference ⋮ Existence of Solutions of Set Quasi-Optimization Problems Involving Minkowski Difference ⋮ Connectedness of the solution sets in generalized semi-infinite set optimization ⋮ An unified scalarization and Ekeland's variational principle for partial set order ⋮ A note on ``Scalarizations for a set optimization problem using generalized oriented distance function ⋮ Optimality conditions in set-valued optimization problems with respect to a partial order relation by using subdifferentials ⋮ Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach ⋮ Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency ⋮ On Lipschitz continuity of solutions to equilibrium problems via the Hiriart-Urruty oriented distance function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vectorization in set optimization
• New order relations in set optimization
• Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
• Nonconvex scalarization in set optimization with set-valued maps
• Set-valued duality theory for multiple objective linear programs and application to mathematical finance
• Well-posedness for set optimization problems
• Partial order relations on family of sets and scalarizations for set optimization
• Scalarization in set optimization with solid and nonsolid ordering cones
• First-order optimality conditions in set-valued optimization
• A new nonlinear scalarization function and applications
• On the Separation and Order Law of Cancellation for Bounded Sets
• Set-valued optimization in welfare economics
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Degrees of Efficiency and Degrees of Minimality
• Existence theorems of set optimization with set-valued maps
• Variational Analysis and Applications
• Characterizations of set order relations and constrained set optimization problems via oriented distance function
• Set-valued Optimization

This page was built for publication: Scalarizations for a set optimization problem using generalized oriented distance function