Skip to main content
SpringerLink
Log in

On the Solution of Problems of Nonlinear Conditional Optimization on Arrangements by the Cut-Off Method

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

We propose an exact method for the solution of a minimization problem on arrangements of a linear objective function with linear and concave additional constraints. We prove the finiteness of the proposed algorithm of the cut-off method.

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

Access this article

Log in via an institution

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. Yu. H. Stoyan and O. O. Emets', Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Institute of System Investigations in Education, Kiev (1993).

    Google Scholar 

  2. O. A. Emets, “Extremal properties of nondifferentiable convex functions on a Euclidean set of combinations with repetitions,” Ukr. Mat. Zh., 46, No. 6, 680–691 (1994).

    Google Scholar 

  3. O. O. Emets' and A. A. Roskladka, “On estimates for minima of objective functions under optimization on combinations,” Ukr. Mat. Zh., 51, No. 8, 1118–1121 (1999).

    Google Scholar 

  4. S. V. Yakovlev and O. A. Valuiskaya, “Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints,” Ukr. Mat. Zh., 53, No. 9, 1272–1280 (2001).

    Google Scholar 

  5. O. O. Emets' and L. M. Kolechkina, “Optimization problem on permutations with linear-fractional objective function: properties of the set of admissible solutions,” Ukr. Mat. Zh., 52, No. 12, 1630–1640 (2000).

    Google Scholar 

  6. Yu. H. Stoyan, S. V. Yakovlev, O. O. Emets', and O. O. Valuis'ka, “On the existence of a convex extension of functions defined on a hypersphere,” Dopov. Nats. Akad. Nauk Ukr., No. 2, 128–133 (1998).

    Google Scholar 

  7. G. V. Reklaitis, A. Ravindran, and K. M. Ragsdell, Engineering Optimization. Methods and Applications, Wiley, New York (1983).

    Google Scholar 

  8. O. O. Emets' and E. M. Emets', “Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization,” Dopov. Nats. Akad. Nauk Ukr., No. 9, 105–109 (2000).

    Google Scholar 

  9. O. O. Emets' and T. M. Barbolina, “Cut-off method for the solution of linear conditional optimization problems on arrangements,” in: Proceedings of the International Conference Dedicated to the 200th Anniversary of the Birthday of M. V. Ostrogradskii (Poltava, September 26–27, 2001) [in Ukrainian], Poltava (2001), pp. 27–28.

  10. A. A. Korbut and Yu. Yu. Finkel'shtein, Discrete Programming [in Russian], Nauka, Moscow (1969).

    Google Scholar 

  11. I. N. Lyashenko, E. A. Kapagodova, N. V. Chernikova, and N. Z. Shor, Linear and Nonlinear Programming [in Russian], Vyshcha Shkola, Kiev (1965).

Download references

Author information

Authors and Affiliations

  1. Poltava Technical University, Poltava

    O. O. Emets' & T. M. Barbolina

Authors
  1. O. O. Emets'
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. M. Barbolina
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Emets', O.O., Barbolina, T.M. On the Solution of Problems of Nonlinear Conditional Optimization on Arrangements by the Cut-Off Method. Ukrainian Mathematical Journal 55, 729–738 (2003). https://doi.org/10.1023/B:UKMA.0000010252.82873.e9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:UKMA.0000010252.82873.e9

Keywords

Search

Navigation