This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. P. Soltan and P. S. Soltan, “d-convex functions,” Dokl. Akad. Nauk SSSR,249, No. 3, 555–558 (1979).
V. P. Soltan, “Axiomatic approach to the theory of convex functions,” Dokl. Akad. Nauk SSSR,254, No. 4, 813–816 (1980).
V. P. Soltan, “Axiomatic theory of convex sets,” Dokl. Akad. Nauk SSSR,262, No. 6, 1321–1325 (1982).
V. P. Soltan, “d-convexity in graphs,” Dokl. Akad. Nauk SSSR,272, No. 3, 535–537 (1983).
T. T. Arkhipova and I. V. Sergienko, “Coincidence conditions for local and global extrema in optimization problems,” Kibernetika, No. 1, 113–115 (1975).
I. V. Sergienko and L. F. Gulyanitskii, “Frontal algorithms for optimization for multiprocessor ECM,” Kibernetika, No. 6, 1–4 (1981).
I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods of Solution on ECM of Combinatorial Optimization Problems [in Russian], Naukova Dumka, Kiev (1981).
M. M. Kovalev, “Method of partial orders,” Dokl. Akad. Nauk BSSR,24, No. 2, 113–116 (1980).
V. A. Emelichev and V. G. Ovchinnikov, “Symmetric supermatroids,” Dokl. Akad. Nauk BSSR,27, No. 5, 389–391 (1983).
V. A. Emelichev and V. G. Ovchinnikov, “Extrema on coordinate lattices,” Dokl. Akad. Nauk BSSR,27, 581–583 (1983).
J. L. Kelly, General Topology, Springer-Verlag (1975).
Additional information
Translated from Kibernetika, No. 5, 58–65, September–October, 1984.
Rights and permissions
About this article
Cite this article
Lebedeva, T.T., Sergienko, I.V. & Soltan, V.P. Conditions for the coincidence of local and global extrema in problems of discrete optimization. Cybern Syst Anal 20, 687–697 (1984). https://doi.org/10.1007/BF01071614
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01071614