Skip to main content
SpringerLink
Log in

Extremal properties of nondifferentiable convex functions on euclidean sets of combinations with repetitions

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

A general approach is suggested for studying extremal properties of nondifferentiable convex functions on Euclidean combinatorial sets. On the basis of this approach, by solving the linear optimization problem on a set of combinations with repetitions, we obtain estimates of minimum values of convex and strongly convex objective functions in optimization problems on sets of combinations with repetitions and establish sufficient conditions for the existence of the corresponding minima.

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. G. Stoyan,Properties of Special Combinatorial Sets, Preprint No. 85, Institute of Mechanical Engineering Problems, Ukrainian Academy of Sciences, Kharkov (1980).

    Google Scholar 

  2. Yu. G. Stoyan and S. V. Yakovlev,Mathematical Models and Optimization Methods for Geometric Design [in Russian], Naukova Dumka, Kiev (1986).

    Google Scholar 

  3. V. F. Dem'yanov and L. V. Vasil'ev,Nondifferentiable Optimization [in Russian], Nauka, Moscow (1981).

    MATH  Google Scholar 

  4. O. A. Emets, “A set of combinations with repetitions mapped inR k and optimization on it,”Dokl. Akad. Nauk Ukr. SSR, No. 4, 69–72 (1991).

    Google Scholar 

  5. O. A. Emets, “Properties of objective functions on combinations and arrangements,” in:Abstracts of XLIII Scientific Conference of Teaching Staff of Poltava Engineering Institute [in Russian], Poltava Engineering Institute, Poltava (1991), p. 283.

    Google Scholar 

  6. A. G. Sukharev, A. V. Timokhov, and V. V. Fedorov,Course in Optimization Methods [in Russian], Nauka, Moscow (1986).

    Google Scholar 

  7. C. Papadimitriou and K. Steiglitz,Combinatorial Optimization. Algorithms and Complexity [Russian translation], Mir, Moscow (1985).

    MATH  Google Scholar 

  8. Yu. I. Zhuravlev, “Local algorithms for computing information, I, II,”Kibernetika, No. 1, 12–20 (1965); No. 2, 1–11 (1965).

    Google Scholar 

  9. Yu. I. Zhuravlev and Yu. Yu. Finkel'shtein, “Local algorithms for problems of linear integer programming,”Probl. Kibernetiki,14, 289–295 (1965).

    Google Scholar 

  10. I. V. Sergienko and M. F. Kaspshitskaya,Models and Methods for Computer Solution of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kiev (1981).

    Google Scholar 

  11. I. V. Sergienko,Mathematical Models and Methods for Solving Problems of Discrete Optimization [in Russian], Naukova Dumka Kiev (1985).

    MATH  Google Scholar 

  12. N. N. Moiseev (editor),Contemporary State of Operation Research Theory [in Russian], Nauka, Moscow (1979).

    Google Scholar 

Download references

Authors
  1. O. A. Emets
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kharkov Institute of Radioelectronics, Kharkov. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 6, pp. 680–691, June, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Emets, O.A. Extremal properties of nondifferentiable convex functions on euclidean sets of combinations with repetitions. Ukr Math J 46, 735–747 (1994). https://doi.org/10.1007/BF02658175

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02658175

Keywords

Search

Navigation