Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
From MaRDI portal
Publication:5317533
DOI10.1137/040603097zbMath1114.90115OpenAlexW1997275160MaRDI QIDQ5317533
Dinh The Luc, Michel Volle, Thai Quynh Phong
Publication date: 16 September 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040603097
Related Items (16)
Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set ⋮ A modified Quasi-Newton method for vector optimization problem ⋮ A combined scalarization method for multi-objective optimization problems ⋮ A numerical method for constructing the Pareto front of multi-objective optimization problems ⋮ A trust-region approach for computing Pareto fronts in multiobjective optimization ⋮ A new duality approach to solving concave vector maximization problems ⋮ Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming ⋮ Generating the weakly efficient set of nonconvex multiobjective problems ⋮ A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization ⋮ A general approach for studying duality in multiobjective optimization ⋮ Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program ⋮ A jointly constrained bilinear programming method for solving generalized Cournot–Pareto models ⋮ A new scalarization method for finding the efficient frontier in non-convex multi-objective problems ⋮ Set Optimization—A Rather Short Introduction ⋮ Solving generalized convex multiobjective programming problems by a normal direction method ⋮ A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
This page was built for publication: Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
