Skip to main content
SpringerLink
Log in

A connected extremum problem for a linear stieltjes functional

  • Published:
Cybernetics Aims and scope

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

References

  1. M. I. Zhaldak and B. S. Kovbasenko, “A problem of quadratic programming,” DAN USSR [Ukrainian], Kiev, no. 8, pp. 990–993, 1965.

    Google Scholar 

  2. S. I. Zukhovitskii, “Algorithm for constructing the Chebyshev approximation of a continuous function by a polynomial,” DAN SSSR, Moscow, vol. 120, no. 4, pp. 693–696, 1958.

    Google Scholar 

  3. A. J. Goldman and A. W. Tucker, “Theory of linear programming,” Collection: Linear Inequalities and Related Systems [Russian translation], IL, Moscow, pp. 172–212, 1959

    Google Scholar 

  4. Lai Wan-cai, “Typically real star functions,” Acta Math. Sinica, Peking, vol. 13, no. 3, pp. 389–404, 1963.

    Google Scholar 

Download references

Authors
  1. S. A. Kas'yanyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 4, No. 5, pp. 79–83, 1968 UDC 519.8

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kas'yanyuk, S.A. A connected extremum problem for a linear stieltjes functional. Cybern Syst Anal 4, 62–65 (1968). https://doi.org/10.1007/BF01077177

Download citation

  • Issue Date:

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

Keywords

Search

Navigation