On the choice of special Pareto points. (3rd August 2017)

• Record Type: Journal Article
• Authors: Graña Drummond, L. M.
• Is Part Of: Optimization. Volume 66:Number 8(2017)
• Page Start: 1251
• Page End: 1257
• Publication Date: 2017-08-03
• Subjects: Multiobjective programming -- Pareto optimality -- ideal optimality -- nonlinear optimization; Mathematical optimization -- Periodicals; 519.7
• DOI: 10.1080/02331934.2017.1327960
• Languages: English
• ISSNs: 0233-1934

Abstract

Abstract: We propose two strategies for choosing Pareto solutions of constrained multiobjective optimization problems. The first one, for general problems, furnishes balanced optima, i.e. feasible points that, in some sense, have the closest image to the vector whose coordinates are the objective components infima. It consists of solving a single scalar-valued problem, whose objective requires the use of a monotonic function which can be chosen within a large class of functions. The second one, for practical problems for which there is a preference among the objective's components to be minimized, gives us points that satisfy this order criterion. The procedure requires the sequential minimization of all these functions. We also study other special Pareto solutions, the sub-balanced points, which are a generalization of the balanced optima.