Scalarization of vector optimization problems
Journal of Optimization Theory and Applications
Norm-Based Approximation in Bicriteria Programming
Computational Optimization and Applications
Monotonic Optimization: Problems and Solution Approaches
SIAM Journal on Optimization
SIAM Journal on Optimization
A New Duality Approach to Solving Concave Vector Maximization Problems
Journal of Global Optimization
Constrained optimization using multiple objective programming
Journal of Global Optimization
Multi-objective genetic algorithms: Problem difficulties and construction of test problems
Evolutionary Computation
Generating the weakly efficient set of nonconvex multiobjective problems
Journal of Global Optimization
Finding representative systems for discrete bicriterion optimization problems
Operations Research Letters
| Hi-index | 0.00 |
The main purpose of this paper is to present a method for generating a representation of efficient solutions and efficient values for nonconvex multiobjective optimization problems. The method is based on a particular outer approximation of nonconvex sets by so-called free disposal nonconvex polyhedra. The convergence of the method is proven, and a discussion on the rate of convergence is addressed with emphasis on the case of two objectives. Examples of up to four objectives are tested, some of which are taken from the recent literature. The numerical experience shows that the optimal value representation obtained by the algorithm is nicely distributed among the set of efficient values of the problem.