Luc, Dinh The; Phong, Thai Quynh; Volle, Michel Scalarizing functions for generating the weakly efficient solution set in convex multiobjective problems. (English) Zbl 1114.90115 SIAM J. Optim. 15, No. 4, 987-1001 (2005). Summary: A method that uses normal directions of convex sets is proposed to construct a sequence of scalarizing functions which generates all weakly efficient solutions of a convex multiobjective optimization problem. The convergence of the method is proven and some small-scale numerical examples are given. Cited in 15 Documents MSC: 90C29 Multi-objective and goal programming 90C25 Convex programming Keywords:convex multiobjective problem; efficient solution; normal direction; scalarization PDF BibTeX XML Cite \textit{D. T. Luc} et al., SIAM J. Optim. 15, No. 4, 987--1001 (2005; Zbl 1114.90115) Full Text: DOI OpenURL