Universal procedure for constructing a Pareto set

DOI10.1134/S0965542517010122zbMath1380.90247OpenAlexW2588927332MaRDI QIDQ2357117

Ya. I. Rabinovich

Publication date: 19 June 2017

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542517010122

zbMATH Keywords

multiobjective optimizationnonnegative orthantfinite dimensionalGermeier convolutionuniversal procedure(weak) effective solutions\(\omega\) concavityparametric construction of Pareto set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Convexity of real functions of several variables, generalizations (26B25) Multiobjective variational problems, Pareto optimality, applications to economics, etc. (58E17)

Related Items (1)

Synthesis of numerical methods for Pareto set approximation based on a universal procedure

Cites Work

• Approximate reduction of the problem of determining a maximin to the problem of determining a maximum by means of penalty functions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Universal procedure for constructing a Pareto set