Skip to main content
Log in

Solving Extremum Problems with Linear Fractional Objective Functions on the Combinatorial Configuration of Permutations Under Multicriteriality

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The authors consider the extremum optimization problem with linear fractional objective functions on combinatorial configuration of permutations under multicriteria condition. Solution methods for linear fractional problems are analyzed to choose the approach to problem’s solution. A solution technique based on graph theory is proposed. The algorithm of the modified coordinate method’s subprogram with search optimization is described. It forms a set of points that satisfy additional constraints of the problem. The general solution algorithm without linearization of the objective function and it’s block diagram are proposed. Examples of the algorithm are described.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Studniarski, “Stopping criteria for genetic algorithms with application to multiobjective optimization,” in: R. Schaefer et al. (eds.), Parallel Problem Solving from Nature, PPSN XI, Pt. I, Lect. Notes Comput. Sci., Vol. 6238, 697–706 (2010).

  2. G. A. Donets and L. N. Kolechkina, “On one problem of optimization of a linear fractional function on permutations,” J. Autom. Inform. Sci., Vol. 42, Issue 4, 1–12 (2010).

  3. G. P. Donets and L. M. Koliechkina, Extremum Problems on Combinatorial Configurations [in Ukrainian], PUET, Poltava (2011).

    Google Scholar 

  4. O. O. Emets and L. M. Koliechkina, Combinatorial Optimization Problems with Linear Fractional Objective Functions [in Ukrainian], Naukova Dumka, Kyiv (2005).

    Google Scholar 

  5. L. M. Koliechkina and E. A. Rodionova, “Multicriteria combinatorial optimization problems on a set of polypermutations,” Cybern. Syst. Analysis, Vol. 44, No. 2, 276–282 (2008).

    Article  MATH  Google Scholar 

  6. L. M. Koliechkina, O. A. Dvernaya, and A. N. Nagornaya, “Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations,” Cybern. Syst. Analysis, Vol. 50, No. 4, 620–626 (2014).

    Article  MATH  Google Scholar 

  7. L. M. Koliechkina, Properties of Multicriteria Optimization Problems on Combinatorial Sets and Methods of their Solution [in Ukrainian], RVV PUSKU, Poltava (2008).

    Google Scholar 

  8. N. V. Semenova and L. M. Koliechkina, Vector Discrete Optimization Problems on Combinatorial Sets: Methods of Analysis and Solution [in Ukrainian], Naukova Dumka, Kyiv (2009).

    Google Scholar 

  9. N. V. Semenova, L. N. Kolechkina, and A. N. Nagornaya, “One approach to solving vector problems with fractionally linear functions of the criteria on the combinatorial set of arrangements,” J. Autom. Inform. Sci., Vol. 42, Issue 2, 67–80 (2010).

  10. R. E. Steuer, Multicriteria Optimization: Theory, Computation, and Application, Wiley Series in Probability and Statistics, Wiley (1986).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to L. M. Koliechkina.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, July–August, 2017, pp. 113–123.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Koliechkina, L.M., Dvirna, O.A. Solving Extremum Problems with Linear Fractional Objective Functions on the Combinatorial Configuration of Permutations Under Multicriteriality. Cybern Syst Anal 53, 590–599 (2017). https://doi.org/10.1007/s10559-017-9961-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-017-9961-3

Keywords

Navigation