Literature Cited
T. Philip, An Algorithm for Combined Quadratic and Multiobjective Programming (1977).
S. Smale, “Global analysis and Economics VI: geometric analysis of Pareto optima and price equilibria under classical hypotheses,” Math. Econ., No. 2, 1–14 (1976).
Iterative Methods in Game Theory and Programming [in Russian], Nauka, Moscow (1974).
M. Zeleny, “Linear multiobjective programming,” Lect. Notes in Economics and Mathematical Systems,95, Springer-Verlag, Berlin-New York (1974).
S. Karlin, Mathematical Methods in Game Theory, Programming and Economics I, II, Addison-Wesley, Reading, Mass. (1959).
A. J. Goldman and A. W. Tucker, “Polyhedral convex cones,” in: Linear Inequalities and Related Systems, H. W. Kuhn and A. W. Tucker (eds.), Princeton Univ. Press, Princeton (1956), pp. 19–40.
K. J. Arrow, E. W. Barankin, and D. Blackwell, “Admissible points of convex sets,” in: Contributions to the Theory of Games, H. W. Kuhn and A. W. Tucker (eds.), Vol. II, Trinceton Univ. Press, Princeton (1953), pp. 87–91.
G. K. Eganyan, “An algorithm for the determination of the Pareto set in problems of vector optimization,” in: Automated Systems of Planning and Control [in Russian], Erevan (1980), pp. 164–172.
Additional information
Central Economicomathematics Institute, Academy of Sciences of the USSR, Moscow. National Economics Institute, Erevan. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 24, No. 2, pp. 9–17, March–April, 1983.
Rights and permissions
About this article
Cite this article
Volkonskii, V.A., Eganyan, G.K. & Pomanskii, A.B. Set of efficient points in linear multicriteria problems. Sib Math J 24, 159–167 (1983). https://doi.org/10.1007/BF00968733
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00968733