Characterization of the equality of weak efficiency and efficiency on convex free disposal hulls
Preprint
Abstract
In solving a multi-objective optimization problem by scalarization techniques, solutions to a scalarized problem are, in general, weakly efficient rather than efficient to the original problem. Thus, it is crucial to understand what problem ensures that all weakly efficient solutions are efficient. In this paper, we give a characterization of the equality of the weakly efficient set and the efficient set, provided that the free disposal hull of the domain is convex. By using this characterization, we obtain various mathematical applications. As a practical application, we show that all weakly efficient solutions to a multi-objective LASSO with mild modification are efficient.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- LASSO multi-objective learning algorithm for feature selectionSoft Computing, 2020
- Involving the Helly number in Pareto reducibilityOperations Research Letters, 2008
- Sparse inverse covariance estimation with the graphical lassoBiostatistics, 2007
- MOEA/D: A Multiobjective Evolutionary Algorithm Based on DecompositionIEEE Transactions on Evolutionary Computation, 2007
- Structure of efficient sets in lexicographic quasiconvex multicriteria optimizationOperations Research Letters, 2006
- Pareto reducible multicriteria optimization problemsOptimization, 2005
- Sparsity and Smoothness Via the Fused LassoJournal of the Royal Statistical Society Series B: Statistical Methodology, 2004
- On the number of criteria needed to decide Pareto optimalityMathematical Methods of Operations Research, 2002
- The Structure of the Efficient Frontier of Finite-Dimensional Completely-Shaded SetsJournal of Mathematical Analysis and Applications, 2000
- Scalarizing vector optimization problemsJournal of Optimization Theory and Applications, 1984