Abstract
A universal computational procedure is used to construct numerical methods for Pareto set approximation. The numerical methods are developed relying on the assumptions necessary for proving the convergence of the universal procedure to the Pareto set.
Similar content being viewed by others
REFERENCES
Ya. I. Rabinovich, “Universal procedure for constructing a Pareto set,” Comput. Math. Math. Phys. 57 (1), 45–63 (2017).
M. S. Bazaraa and C. M. Shetty, Nonlinear Programming: Theory and Algorithms (Wiley, New York, 1979).
B. T. Polyak, Introduction to Optimization (Nauka, Moscow, 1983; Optimization Software, New York, 1987).
V. V. Podinovski and V. D. Noghin, Pareto Optimal Solutions of Multicriteria Problems (Fizmatlit, Moscow, 2007) [in Russian].
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated by I. Ruzanova
Rights and permissions
About this article
Cite this article
Rabinovich, Y.I. Synthesis of Numerical Methods for Pareto Set Approximation Based on a Universal Procedure. Comput. Math. and Math. Phys. 60, 528–539 (2020). https://doi.org/10.1134/S096554252003015X
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S096554252003015X