Abstract
The notion of efficient (nondominated, noninferior. Pareto-optimal, functional efficient) set to a Vectormaximum Problem (VMP) has been analysed and developed in several directions during the last 30 years. Starting with the basic notion of efficiency given by Pareto [1896], formal descriptions of the efficient, properly efficient, locally (proper-) efficient, weak or strong efficient set have been developed beginning in the 50th of this century. Based on these notions various characteristics and properties of the efficient set have been studied, whereas the feasible set X and the functions zk(x), k = 1,.., K, constituting the vector-valued criterion z(x) of VMP have various properties (e.g., convexity of X, concavity of zk(x) for all k, differentiability etc.). Based on such properties, the structure of the efficient set and the existence of efficient solutions have been analysed. A part of the corresponding publications are rather of a pure theoretical character, others try to develope theories serving as the basis for working out methods for determining the efficient set or for interactive methods determining some compromise solutions. Duality theories for more or less general cases have been developed and various aspects of stability of VMP have been investigated. A brief survey is given.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. ACHILLES, K.-H. ELSTER and R. NEHSE, “Bibliographie zur Vektor-optimierung (Theorie und Anwendungen)”.Mathem. Operationsforschung und Statistik 10 (1979) 277–321.
I. P. ANEJA and K. P. K. NAIR, “Bicriteria Transportation Problem” Managern. Sci. 25 (1979) 73–78.
F. A. BEHRINGER, “Lexicographic Quasiconcave Multiobjective Programming”. Zeitschrift für Operations Research 21 (1977) 103–116.
A. BEN-ISRAEL, A. BEN-TAL and S. ZLOBEC, “Optimality Conditions in Convex Programming”. In: Survey of Mathematical Programming (A. PREKOPA, ed. ), Hungarian Academy of Science and North Holland (1979).
A. BEN-ISRAEL, A. BEN-TAL and A. CHARNES, “Necessary and Sufficient Conditions for a Pareto-Optimum in Convex Programming”. Econometrica 45 (1977) 811–820.
H. P. BENSON, “Existence of Efficient Solutions for \Tectormaximum problems”. JOTA 26 (1978) 569–580.
H. P. BENSON, “An Improved Definition of Proper Efficiency for Vector Maximization with Respect to Cones”. J. of Math. Analysis and Appl. 71 (1979), 232–241.
H. P. BENSON and T. L. MORIN, “The Vector Maximization Problem: Proper Efficiency and Stability”. SIAM J. on Applied Mathematics 32 (1977) 64–72.
A. BEN-Tal, A. BEN-ISRAEL and S. ZLOBEC, “Characterization of Optimality in Convex Programming without Constraint Qualification”. JOTA 20 (1976) 417–437.
A. BEN-TAL, “Characterization of Pareto and Lexicographic Optimal Solutions”. In: Multiple Criteria Decision Making: Theory and Application ( G. FANDEL and T. GAL, eds.), Springer, New York (1980), 1–11.
A. BEN-TAL and S. ZLOBEC, “Convex Programming and the Lexicographic Multicriteria Problem”. Mathem. Operationsforschung und Statistik, Series Optimization 8 (1977) 61–73.
M. BENVENISTE, “Testing for Complete Efficiency in a Vector Maximum Problem”. Mathem. Progr. 12 (1977) 285–288.
K. BERGSTRESSER and P. L. YU, “Domination Structures and Multicriteria Problems in n-Person Games”. Theory and Decision 8 (1977) 5–48.
G. R. BITRAN, “Linear Multiple Objective Programs with Zero-One Variables”. Mathem. Progr. 13 (1977) 121–139.
G. R. BITRAN, “Duality for Nonlinear Multiple Criteria Optimization Problems”. Techn. Rep. No 155, Massachussets Inst. of Technology, (September 1978); JOTA 35 (1981) 367–401.
G. R. BITRAN and T. L. MAGNANTI, The Structure of Admissible Points with Respect to Cone Dominance“. JOTA 29 (1979) 573–614.
G. R. BITRAN and T. L. MAGNANTI, “Duality Based Characterizations of Efficient Facets”. In: Multiple Criteria Decision Making: Theory and Application ( G. FANDEL and T. GAL, eds.), Springer, New York (1980) 12–25.
P. BOD, “Lineâris Programozâs töBB, Egyidejüleg Adott Célfüggvény Szerint”. Publ. of The Math. Inst. of the Hungarian Academy of Sciences, Ser. B, 8 (1963) 541–544.
J. M. BORWEIN, “Proper Efficient Points for Maximizations with Respect to Cones.” SIAM J. Control Optimization 15 (1977) 57–63.
J. M. BORWEIN, The Geometry of Pareto Efficiency over Cones“. Math. Operationsforschung und Statistik, Ser. Optimization 11 (1980) 235–248.
P. BRUCKER, “Diskrete parametrische Optimierungsprobleme und wesentlich effiziente Punkte”. Zeitschrift für Operations Research 16 (1972) 189–197.
A. CHARNES and W. W. COOPER, “Management Models and Industrial Applications of Linear Programming”. Managem. Sci. 4 (1957) 81–87.
A. CHARNES and W. W. COOPER, “Management Models and Industrial Applications of Linear Programming I”. Appendix B: Basic Existence Theorems and Goal Programming. Wiley, New York (1961) 299–310.
A. CHARNES and W. W. COOPER, “Goal Programming and Multiple Objective Optimization. Part 1”. European J. for Operational Research 1 (1977) 39–54.
J. L. COHON and D. H. MARKS, “A Review and Evaluation of Multiobjective Programming Techniques”. Water Resources Research 11 (1975) 208–220.
J. L. COCHRANE and M. ZELENY (eds.), “Multiple Criteria Decision Making”. University of South Carolina Press, Columbia (1973).
H. W. CORLEY, “A New Scalar Equivalence for Pareto Optimization”, JEEE Transactions on Automatic Control 25 (1980) 829–830.
H. G. DAELLENBACH and C. A. de KLUYVER. A. de KLUYVER, “Note on Multiple Objective Dynamic Programming”. J. of Opl. Res. Soc. 31 (1980) 591–594.
G. DEBREU, “Representation of a Preference Ordering by a Numerical Function”. Decision Processes (R. M. THRALL, C. H. COOMBS and R. L. DAVIS, eds.), Wiley, New York (1954) 159–166.
G. DEBREU, “Theory of Value”. Wiley, New York (1959).
J. H. DIAZ, “Finding a Complete Description of all Efficient Solutions to a Multiobjective Transportation Problem”. Ekonomicko-Matematickÿ Obzor 15 (1979) 62–73.
F. di GUGLIELMO, “Nonconvex Duality in Multiobjective Optimization”. Mathematics of Operations Research 2 (1977) 285–291.
W. DINKELBACH, “Sensitivitätsanalysen und parametrische Programmierung”. Springer, Berlin, New York (1969).
W. DINKELBACH, “Über einen Lösungsansatz zum Vektormaximum-Problem”. In: Lecture Notes in OR and Math. Syst. 50 (1971) 1–13.
A. J. DUBOVITSKIJ and A. A. MILJUTIN, “Extremum Problems in the Presence of Restrictions”. Zh. Vychisl. Mat. Fiz. 5 (1969) 395–453 (USSR Comp. Math. and Math. Phys. 5 (1965) 1–80 ).
W. DÜRR, “Stochastische Programmierungsmodelle als Vektormaximumprobleme”. In: Proceedings in Operations Research, Physica-Verlag, Würzburg-Wien (1972) 189–199.
R. T. ECKENRODE, “Weighting Multiple Criteria”. Managem. Sci. 12 (1965) 180–192.
J. G. ECKER, N. S. HEGNER and I. A. KOUADA, “Generating all Maximal Efficient Faces for Multiple Objective Linear Programs”. JOTA 30 (1980) 353–381.
J. G. ECKER and I. A. KOUADA, “Finding Efficient Points for Linear Multiple Objective Programs.” Math. Progr. 8 (1975) 375–377.
J. G. ECKER and I. A. KOUADA, “Finding all Efficient Extreme Points for Multiple Objective Linear Programs”. Math. Progr. 14 (1978) 249–261.
J. P. EVANS and R. E. STEUER, “A Revised Simplex Method for Linear Multiple Objective Programs”. Math. Progr. 5 (1973) 375–377.
G. FANDEL, “Lösungsprinzipien und Lösungsalgorithmen zum Vektormaximumproblem bei Sicherheit und Unsicherheit”. Zs. für Betriebswirtsch. (1975) 371–392.
G. FANDEL, “Perspectives of the Development in Multiple Criteria Decision Making”. In: Multiple Criteria Decision Making: Theory and Applications (G. FANDEL and T. GAL, eds.), Springer, New York (1980) IX - XVI.
G. FANDEL and T. GAL (eds.), “Multiple Criteria Decision Making: Theory and Application”. Springer, New York (1980).
G. FANDEL and J. WILHELM, “Zur Entscheidungstheorie bei mehrfacher Zielsetzung”. Zeitschrift für OR 20 (1976) 1–21.
P. C. FISHBURN, “A Survey of Multiattribute/Multicriterion Evaluation Theories”. In: Multiple Criteria Problem Solving (S. ZIONTS, ed. ), Springer New York (1978) 181–224.
J. FOCKE, “Vektormaximumproblem und parametrische Optimierung”. Math. Operationsforschung und Statistik 4 (1973) 365–369.
R. M. FREIMER and P. L. YU. YU, “An Approach Towards Decision Problems with Multiobjectives”.Res. Rep. No CSS 72–03, University of Rochester, New York (June 1972).
T. GAL, “A General Method for Determining the Set of all Efficient Solutions to a Linear Vectormaximum Problem”. European J. for Operational Research 1 (1977) 307–322.
T. GAL, “Postoptimal Analyses, Parametric Programming and Related Topics”, McGraw Hill, New York (1979).
T. GAL, “A Note on Size Reduction of the Objective Functions Matrix in Vectormaximum Problems”. In: Multiple Criteria Decision Making: Theory and Application ( G. FANDEL and T. GAL, eds.), Springer, N. Y. (1980) 74–84.
T. GAL, “Postefficient Sensitivity Analysis in Linear Vectormaximum Problems”. In: Multiple Criteria Analysis ( P. NIJKAMP and J. SPRONK, eds.), Gower Publ. Co., Aldershot, Hampshire England (1981) 259–270.
T. GAL and H. LEBERLING, “Relaxation Analysis in Linear Vectorvalued Maximization”. Working Paper No 76/15, University of Aachen 1976, EJOR 8 (1981) 274–282.
T. GAL and H. LEBERLING, “Redundant Objective Functions in Linear Vectormaximum Problems and Their Determination”. European J. for Operations Research 1 (1977) 176–184.
D. GALE, H. W. KUHN and A. W. TUCKER, “Linear Programming and the Theory of Games”. In: Activity Analysis of Production and Allocation ( T. C. KOOPMANS, ed.), Wiley, N.Y. (1951).
J. H. van GELDROP. H. van GELDROP, “A Note on Local Pareto Optima”. J. of Math. Economics 7 (1980) 51–54.
A. M. GEOFFRION, “Solving Bicriterion Mathematical Programs”. Oper. Res. 15 (1967a) 38–54.
A. M. GEOFFRION, “Strictly Concave Parametric Programming I”. Managem. Sci. 13 (1967b) 244–253
A. M. GEOFFRION, “Strictly Concave Parametric Programming II”. Managem. Sci. 13 (1967c) 359–370.
A. M. GEOFFRION, “Proper Efficiency and The Theory of Vectormaximization”. J. of Math. Anal. and Appl. 22 (1968) 618–630.
A. M. GEOFFRION, J. S. DYER and A. FEINBERG, “An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department”. Managem. Sci. 19 (1972) 1387–1396.
R. GUESNERIE, “Pareto Optimality in Nonlinear-Convex Economics”. Econometrica 43 (1975) 1–29.
Y. Y. HAIMES, W. A. HALL and H. T. FREEDMAN, “Multiobjective Optimization in Water Resource Systems”. Elsevier Scientific Publ. Co., N. Y. (1975).
E. L. HANNAN, “Using Duality Theory for Identification of Primal Efficient Points and for Sensitivity Analysis in Multiple Objective Linear Programming”. J. Opl. Res. Soc., 29 (1978) 643–649.
P. HANSEN, (ed.), “Proceedings of The Multiple Criteria Decision Making Symposium in Mons, Belgium”. To appear with Springer, N. Y. (1983).
R. HARTLEY, “On Cone-Efficiency, Cone-Convexity and Cone-Compactness”. SIAM J. of Applied Mathematics 34 (1978) 211–222.
M. I. HENIG, “A Generalized Method of Approximating the Set of Efficient Points with Respect to a Convex cone”. In: Organisations, Multiple Agents with Multiple Criteria ( J. MORSE, ed.), Springer, N. Y. (1981) 140–144.
R. HETTICH, “Charakterisierung lokaler Pareto-Optima”. Lecture Notes in Economics and Mathematical Systems No 117, Springer, N. Y. (1976) 127–141.
W. HILDENBRANDT, “Core and Equilibria of a Large Economic”. Princeton Univ. Press, Princeton, N. Y. (1975).
C. L. HWANG and A. S. M. MASUD, “Multiple Objective Decision Making - Methods and Applications”. Springer, N. Y./Berlin (1979).
J. P. IGNIZIO, “Goal Programming and Extensions”. Lexington Books, Lexington, Mass. (1976).
J. P. IGNIZIO, “A Review of Goal Programming: A Tool for Multiobjective Analysis”. J. Opl. Res. Soc. 29 (1978) 1109–1119.
Y. IJIRI, “Management Goals and Accounting for Control”. North Holland, Amsterdam (1965).
H. ISERMANN, “Lösungsansätze zum Entscheidungsproblem des Satisfizierens bei mehrfacher Zielsetzung”. Proc. Operations Research 3 (1974a) 64–74.
H. ISERMANN, “Proper Efficiency and the Linear Vector Maximum Problem”. Oper. Res. Quart. 22 (1974b) 189–191.
H. ISERMANN, “The Relevance of Duality in Multiple Objective Linear Programming”. TIMS Studies in the Managern. Sciences 6 (1977a) 241–262.
H. ISERMANN, “The Enumeration of the Set of all Efficient Solutions for a Linear Multiple Objective Program”. Opl. Res. Quart. 28 (1977b) 711–725.
H. ISERMANN, “On Some Relations Between a Dual Pair of Multiple Objective Linear Programs”. Zeitschrift f. Operations Research 22 (1978), 33–41.
J. JAHN, “Duality Theory for Vector Optimization Problems in Normed Linear Spaces”. Work. Paper No 534, Technische Universität Darmstadt (February 1980).
E. JOHNSEN, “Studies in Multiobjective Decision Models”. Studentlit., Lund, Sweden (1968).
K. C. KAPUR, “Mathematical Methods of Optimization for Multi-Objective Transportation Systems”. Socio-Economic Planning Science 4 (1970) 451–467.
S. KARLIN, “Mathematical Methods and Theory in Games, Programming and Economics”. Reading (Mass.), Palo Alto (1962).
R. L. KEENEY and H. RAIFFA, “Decisions with Multiple Objectives: Preferences and Value Tradeoffs”. Wiley, N. Y. (1976).
G. J. KELLEHER, “A Serialized Linear Programming Model for Obtaining Successive Minimax Strategies”. J. Oper. Res. Soc. Japan 12 (1970) 87–93.
A. KLINGER, “Improper Solutions of the Vector Maximum Problem”. Operations Research 15 (1967) 570–572.
T. C. KOOPMANS, “Analysis of Production as an Efficient Combination of Activities”. In: Activity Analysis of Production and Allocation ( T. C. KOOPMANS, ed.), Yale Univ. Press, New Haven (1951) 33–97.
J. S. H. KORNBLUTH, “Duality, Indifference and Sensitivity Analysis in Multiple Objective Linear Programming”. Opl. Res. Quart. 25 (1974) 599–614.
J. H. S. KORNBLUTH and R. E. STEUER, “Multiple Objective Linear Fractional Programming”. Decision Sciences.Working Paper No 79–03–19, The Warton School, Univ. of Pennsylvania (1979).
J. H. S. KORNBLUTH and R. E. STEUER, “On Computing the Set of all Weakly Efficient Vertices in Multi-Objective Linear Fractional Programming”. In: Multiple Criteria Decision Making: Theory and Application ( G. FANDEL and T. GAL, eds.), Springer, N. Y. (1980) 189–202.
H. W. KUHN and A. W. TUCKER, “Nonlinear Programming”. In: Proc. of the 2nd Berkley Symposium on Mathematical Statistics and Probability ( J. NEYMAN, ed.), Univ. of California Press, Berkley, California (1951) 481–492.
H. LEBERLING, “Zur Theorie der linearen Vektormaximumprobleme”. Dissertation, Universität Aachen (1977).
S. M. LEE, “Goal Programming for Decision Analysis”. Auerbach Publ., Philadelphia (1972).
R. LEHMANN und W. OETTLI, “The Theorem of the Alternative, the Key theorem, and the Vectormaximum Problem”. Math. Progr. 8 (1975) 332–344.
K. R. MacCRIMMON, “An Overview of Multiple Objective Decision Making”. In: Multiple Criteria Decision Making ( J. L. COCHRANE and M. ZELENY, eds.), University of South Carolina Press, Columbia (1973) 18–44.
M. MANAS, “IIlohy Vektorové Maximalizace”. Matematicko-Ekonomickÿ Obzor 14 (1978) 251–265.
O. L. MANGASARIAN and W. R. S. SUTHERLAND, “Solution of the Linear Inverse Vector Optimization Problem by a Simple Linear Program”. Math. Progr. 15 (1978) 232–235.
G. MENGES and H. DIEHL, “Über die operationale Eignung von Entscheidungsmodellen”. Statistische Hefte 7 (1966) 30–41.
V. V. MERKURIEV and M. A. MOLDAVSKII, “A Family of Convolutions of a Vector-Valued Criterion for Finding Points in a Pareto-Set”. Automation and Remote Control 40 (1970) 87–97.
J. MORSE, (ed.), “Organizations: Multiple Agents with Multiple Criteria”. Springer, N. Y. (1981).
P. H. NACCACHE, “Stability in Multicriteria Optimization”. PhD Thesis, Univ. of California at Berkley, Berkley, California (1977).
P. H. NACCACHE, “Connectedness of the Set of Nondominated Outcomes in Multicriteria Optimization”. JOTA 25 (1978) 459–467.
H. NAKAYAMA, “Duality and Related Theorems in Convex Vector Optimization”. Research Rep. No 4, Konan Univ. Kobe, Japan (July 1980).
J. von NEUMANN and O. MORGENSTERN. MORGENSTERN, “ Theory of Games and Economic Behaviour”. Princeton Univ. Press, Princeton, N. Y. (1944).
W. OETTLI, “A Duality Theorem for the Nonlinear Vectormaximum Problem”. In: Colloquia Mathematica Societatis Janos Bolyai, 12. Progress in OR, Eger (Hungary) (1974) 697–703.
V. PARETO, “Cours d’Economie Politique”. Rouge, Lausanne (1896).
J. PHILIP, “Algorithms for the Vectormaximization Problem”. Math. Prog. 2 (1972) 207–229.
J. PHILIP, “Vector Maximization at a Degenerate Vertex”. Math. Progr. 13 (1977) 357–359.
V. V. PODINOVSKIJ, “Lexicographical Games”. Advances in Game Theory, Proc. Sec. USSR Game Theory Conference, Vilnius (1973).
D. RAND, “Thresholds in Pareto Sets”. J. of Mathematical Economics 3 (1976) 139–154.
P. RIETVELD, “Multiple Objective Decision Methods and Regional Planning”. North Holland, Amsterdam (1980).
W. RÖDDER, “A Generalized Saddlepoint Theory”. European J. of Operational Research 1 (1977) 55–59.
B. ROY, “Problems and Methods with Multiple Objective Functions”. Math. Progr. 1 (1971) 239–266.
B. ROY, From Optimization on a Fixed Set to Multicriteria Decision Aid“. In: Multiple Criteria Decision Making: Jouy-en-Josas, France ( H. THIRIEZ and S. ZIONTS, eds.), Springer, N. Y. (1976).
D. G. SAARI, “Singularity Theory of Utility Mappings–I. Degenerate Maxima and Pareto Optima”. J. of Mathematical Economics 59 (1977) 217–251.
P. SCHÖNFELD, “Some Duality Theorems for the Non-Linear Vectormaximum Problem”. Unternehmensforschung 14 (1970) 51–63.
C. P. SIMON and C. TITUS, “Characterization of Optima in Smooth Pareto Economic Systems”. J. of Math. Economics 2 (1975) 297–330.
S. SMALE, “Global Analysis and Economics: III. Pareto Optima and Price Equilibria”. J. of Mathematical Economics 1 (1974a) 107–117.
S. SMALE, “Global Analysis and Economics: V. Pareto Theory with Constraints”. J. of Math. Econ. 1 (1974b) 213–221.
S. SMALE, “Global Analysis and Economics: VII. Geometric Analysis of Pareto Optima and Price Equilibria under Classical Hypothesis”. J. of Math. Econ. 3 (1976) 1–14.
R. M. SOLAND, “Multicriteria Optimization: A General Characterization of Efficient Solutions”. Decision Sciences 10 (1979) 26–38.
M. K. STARR and M. ZELENY, “Multi Criteria Decision Making: State and Future of the Arts”. In: Multiple Criteria Decision Making ( M. K. STARR and M. ZELENY, eds.), North Holland, N. Y./Amsterdam (1977) 5–29.
M. K. STARR and M. ZELENY, eds., “Multi Criteria Decision Making”. North Holland, N. Y./Amsterdam (1977).
K. TAMURA, “A Method for Constructing the Polar Cone of a Polyhedral Cone with Applications to Linear Multi Criteria Decision Problems”. JOTA 19 (1976) 547–564.
T. TANINO and Y. SAWARAGI, “Duality Theory in Multiobjective Programming”. JOTA 27 (1979) 509–529.
H. THIRIEZ and S. ZÍONTS, eds., “Multiple Criteria Decision Making”. Springer, N. Y. (1976).
J. VANGELDERE, “Pareto Weak Minimality and Various Connectedness Properties”. Oper. Res. Verfahren 31 (1979) 663–676.
B. VISWANATHAN, V. V. AGGARWAL and K. P. K. NAIR, “Multiple Criteria Markov Decision Processes”. In: Multi Criteria Decision Making ( M. K. STARR and M. ZELENY, eds.) North Holland, N. Y./Amsterdam (1977) 263–272.
Y.-H. WAN, “On Local Pareto Optima”. J. of Mathematical Economics 2 (1975) 35–42.
R. E. WENDELL and D. N. LEE, “Efficiency in Multiple objective Optimization Problems”. Math. Progr. 12 (1977) 406–414.
J. WILHELM, “A Generalized Concept of Solution Principles for the Multi Criteria Decision Making Problem”. European J. for Operational. Research 1 (1977) 376–385.
H. M. WINKELS, “Complete Efficiency Analysis for Linear Vector Maximum Systems”. Work. Paper No 8002, Ruhr-University Bochum, ( July 1980 ).
H. WOLF, “Entscheidungsfindung bei der stochastischen Linearen Optimierung durch Entscheidungsmodelle mit mehrfacher Zielsetzung”. Dissertation, University Hagen (1982).
P. L. YU, “Introduction to Domination Structures in Multi Criteria Decision Problems”. In: Proc. of the Seminar on Multi Criteria Decision Making ( J. L. COCHRANE and M. ZELENY, eds.) University of South Carolina Press, Columbia (1973a) 249–261.
P. L. YU, “A Class of Solutions for Group Decision Problems”. Managern. Sci. 19 (1973b) 936–946.
P. L. YU, “Cone Convexity, Cone Extreme Points and Nondominated Solutions in Decision Problems with Multiobjectives”. JOTA 14 (1974) 319–377.
P. L. YU, “Behaviour Bases and Habitual Domains of Human Decision/ Behaviour–Concepts and Applications”. In: Multi Criteria Decision Making: Theory and Application ( G. FANDEL and T. GAL, eds.) Springer, N. Y. (1980) 511–539.
P. L. YU and G. LEITMANN, “Compromise Solutions, Domination Structures and Salukvadze’s Solution”. Problems of Control and Information Theory 2 (1973) 183–197.
P. L. YU and M. ZELENY, The Set of all Nondominated Solutions in Linear Cases and a Multi Criteria Simplex-Method“. J. of Mathematical Analysis and Applications 49 (1975) 430–468.
M. ZELENY, “Linear Multiobjectiv Programming”. Springer, N. Y. (1974).
M. ZELENY, (ed.) “Multiple Criteria Decision Making: Kyoto 1975”, Springer, N.Y. (1976).
M. ZELENY, “Multiple Criteria Decision Making”. Mc Graw Hill, 1’. Y. (1982).
S. ZIONTS, “Integer Linear Programming with Multiple Objectives”. Annals of Discrete Mathematics 1 (1977) 551–562.
S. ZIONTS, (ed.) “Multiple Criteria Problem Solving”. Springer, N.Y. (1978).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gal, T. (1983). On Efficient Sets in Vector Maximum Problems — A Brief Survey. In: Hansen, P. (eds) Essays and Surveys on Multiple Criteria Decision Making. Lecture Notes in Economics and Mathematical Systems, vol 209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46473-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-46473-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11991-3
Online ISBN: 978-3-642-46473-7
eBook Packages: Springer Book Archive