Generating the weakly efficient set of nonconvex multiobjective problems

Authors:
Daniel Gourion;Dinh The Luc
Affiliations:
University of Avignon, Avignon, France 84000;University of Avignon, Avignon, France 84000
Venue:
Journal of Global Optimization
Year:
2008

Citing 7
Cited 2

Scalarization of vector optimization problems

Journal of Optimization Theory and Applications
Finding all maximal efficient faces in multiobjective linear programming

Mathematical Programming: Series A and B
Outcome space partition of the weight set in multiobjective linear programming

Journal of Optimization Theory and Applications
Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems

SIAM Journal on Optimization
An Outer Approximation Algorithm for Generating AllEfficient Extreme Points in the Outcome Set of a Multiple ObjectiveLinear Programming Problem

Journal of Global Optimization
Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems

SIAM Journal on Optimization
A New Duality Approach to Solving Concave Vector Maximization Problems

Journal of Global Optimization

Finding Efficient Solutions by Free Disposal Outer Approximation

SIAM Journal on Optimization
A numerical method for constructing the Pareto front of multi-objective optimization problems

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for generating the set of weakly efficient solutions of a nonconvex multiobjective optimization problem. The convergence of the method is proven and some numerical examples are encountered.