Skip to main content
Log in

Synthesis of Numerical Methods for Pareto Set Approximation Based on a Universal Procedure

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Ya. I. Rabinovich, “Universal procedure for constructing a Pareto set,” Comput. Math. Math. Phys. 57 (1), 45–63 (2017).

    Article  MathSciNet  Google Scholar 

  2. M. S. Bazaraa and C. M. Shetty, Nonlinear Programming: Theory and Algorithms (Wiley, New York, 1979).

    MATH  Google Scholar 

  3. B. T. Polyak, Introduction to Optimization (Nauka, Moscow, 1983; Optimization Software, New York, 1987).

  4. V. V. Podinovski and V. D. Noghin, Pareto Optimal Solutions of Multicriteria Problems (Fizmatlit, Moscow, 2007) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ya. I. Rabinovich.

Additional information

Translated by I. Ruzanova

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S096554252003015X

Keywords:

Navigation