This is a preview of subscription content, log in via an institution to check access.
Literature Cited
S. I. Zukhovitskii and L. I. Avdeeva, Linear and Convex Programming [in Russian], izd-vo Nauka, Moscow, 1964 (2nd edition, 1967).
L. I. Avdeeva, “On the approximation of an inconsistent system of linear equations,” collection: Economic Cybernetics and Operations Research [in Russian], izd. IK AN UKrSSR, Kiev (1967).
S. I. Zukhovitskii, “An algorithm for the construction of the Chebyshev approximation to a continuous function by means of a polynomial,” Dokl. Akad. Nauk SSSR,120, no. 4 Moscow (1958).
M. I. Zhaldak, “The Chebyshev approximation of a continuous function by a polynomial when there are constraints on the coefficients,” Dokl. Akad. Nauk, SSSR,159, no. 3, Moscow (1964).
J. E. Kelley, “The cutting plane method for solving convex problems,” J. Soc. Ind. Appl. Math.,8, no. 4, (December 1960).
G. Zoutendijk, “Nonlinear programming: a numerical survey,” J. SIAM Control,4, no. 1 (1966).
Additional information
Technological Institute of the Food Industry. Translated from Kibernetika, Vol. 5, No. 3, pp. 89–93, May–June, 1969.
Rights and permissions
About this article
Cite this article
Avdeeva, L.I. The application of convex programming in the solution of problems in Chebyshev approximation. Cybern Syst Anal 5, 343–348 (1969). https://doi.org/10.1007/BF01070924
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070924