Skip to main content
Log in

A compromise method in constrained optimization problems

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The possibility of obtaining a compromise solution to a constrained optimization problem is investigated. The problem is to make the solution to reflect a compromise between the conflicting requirements of extremalization of some objective function and constraint satisfaction. To solve the problem, multicriteria optimization with the use of a nonlinear compromise scheme is applied. An illustrative example is given.

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. A. N. Voronin, Yu. K. Ziatdinov, and A. I. Kozlov, Vector Optimization of Dynamic Systems [in Russian], Tekhnika, Kyiv (1999).

    Google Scholar 

  2. A. N. Voronin, “A nonlinear compromise scheme in multicriteria evaluation and optimization problems,” Cybernetics and Systems Analysis, 45, No. 4, 597–604 (2009).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. N. Voronin.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, January–February, 2013, pp. 91–95.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Voronin, A.N. A compromise method in constrained optimization problems. Cybern Syst Anal 49, 77–80 (2013). https://doi.org/10.1007/s10559-013-9487-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-013-9487-2

Keywords

Navigation