Abstract
We consider extremum points of compact sets with a weak majorization relation. Examples of problems are presented for which these extremum points are optimal solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
N. Meggido, “Optimal flows in networks with multiple sources and sinks,” Math. Program.,7, 97–107 (1974).
N. K. Belenova, “Problem of uniform flow distribution in a network,” Zh. Vychisl. Mat. Mat. Fiz.,21, No. 5, 1116–1125 (1981).
V. G. Vizing, “A schedule ensuring the most uniform loading of machines,” Dokl. Akad. Nauk SSSR,280, No. 3, 525–528 (1985).
G. H. Hardy, J.E. Littlewood, and G. Polya, Inequalities [Russian translation], IL, Moscow (1948).
A. Marshall and I. Olkin, Inequalities: Theory of Majorization and its Applications [Russian translation], Mir, Moscow (1983).
A. N. Kolmogorov and S. V. Fomin, Elements of the Theory of Functions and Functional Analysis [in Russian], Nauka, Moscow (1968).
L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton Univ. Press, NJ (1962).
G. M. Adel'son-Vel'skii, S. A. Dinits, and A. V. Karzanov, Flow Algorithms [in Russian], Nauka, Moscow (1975).
Additional information
Translated from Kibernetika, No. 1, pp. 80–85, January–February, 1991.
Rights and permissions
About this article
Cite this article
Vizing, V.G. Extrema in optimization problems realizing the uniformity principle. Cybern Syst Anal 27, 108–115 (1991). https://doi.org/10.1007/BF01068653
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068653