Approximate solutions and scalarization in set-valued optimization

DOI10.1080/02331934.2016.1271419zbMath1409.90168OpenAlexW2570601627MaRDI QIDQ4598834

C. S. Lalitha, Mansi Dhingra

Publication date: 15 December 2017

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2016.1271419

zbMATH Keywords

approximate solutionsscalarizationPainlevé-Kuratowski convergenceset-valued optimizationGerstewitz function

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (9)

Solving set-valued optimization problems using a multiobjective approach ⋮ 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 ⋮ A Vectorization Scheme for Nonconvex Set Optimization Problems ⋮ Hadamard well-posedness and stability in set optimization ⋮ Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem ⋮ On Lagrange Multiplier Rules for Set-Valued Optimization Problems in the Sense of Set Criterion ⋮ Approximate Benson efficient solutions for set-valued equilibrium problems ⋮ Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency

This page was built for publication: Approximate solutions and scalarization in set-valued optimization