메뉴 건너뛰기




Volumn 57, Issue 1, 2009, Pages 187-199

Generating a representative subset of the nondominated frontier in multiple criteria decision making

Author keywords

Discrete representation; Nondominated frontier; Programming: Multiple criteria

Indexed keywords

COMPUTATION TIME; DISCRETE POINTS; DISCRETE REPRESENTATION; LINEAR PROBLEMS; MULTIPLE CRITERIA DECISION MAKINGS; MULTIPLE OBJECTIVES; NONDOMINATED FRONTIER; PROGRAMMING: MULTIPLE CRITERIA;

EID: 61449161981     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0581     Document Type: Article
Times cited : (40)

References (36)
  • 1
    • 0026222927 scopus 로고
    • Determination of the efficient set in multiobjective linear programming
    • Armand, P., C. Malivert. 1991. Determination of the efficient set in multiobjective linear programming. J. Optim. Theory Appl. 70 467-489.
    • (1991) J. Optim. Theory Appl , vol.70 , pp. 467-489
    • Armand, P.1    Malivert, C.2
  • 2
    • 34249762064 scopus 로고
    • A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
    • Benson, H. P. 1995. A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions. J. Global Optim. 6 231-251.
    • (1995) J. Global Optim , vol.6 , pp. 231-251
    • Benson, H.P.1
  • 3
    • 0032384103 scopus 로고    scopus 로고
    • Hybrid approach for solving multiple-objective linear programs in outcome space
    • Benson, H. P. 1998. Hybrid approach for solving multiple-objective linear programs in outcome space. J. Optim. Theory Appl. 98(1) 17-35.
    • (1998) J. Optim. Theory Appl , vol.98 , Issue.1 , pp. 17-35
    • Benson, H.P.1
  • 4
    • 0031075657 scopus 로고    scopus 로고
    • Towards finding global representations of the efficient set in multiple objective mathematical programming
    • Benson, H. P., S. Sayin. 1997. Towards finding global representations of the efficient set in multiple objective mathematical programming. Naval Res. Logist. 44 47-67.
    • (1997) Naval Res. Logist , vol.44 , pp. 47-67
    • Benson, H.P.1    Sayin, S.2
  • 6
    • 38249033023 scopus 로고
    • Analysis of die objective space in multiple objective linear programming
    • Dauer, J. P. 1987. Analysis of die objective space in multiple objective linear programming. J. Math. Anal. Appl. 126 579-593.
    • (1987) J. Math. Anal. Appl , vol.126 , pp. 579-593
    • Dauer, J.P.1
  • 7
    • 0029779533 scopus 로고    scopus 로고
    • A combined constraint space, objective space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
    • Dauer, J. P., R. J. Gallagher. 1996. A combined constraint space, objective space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs. Eur: J. Oper. Res. 88 368-381.
    • (1996) Eur: J. Oper. Res , vol.88 , pp. 368-381
    • Dauer, J.P.1    Gallagher, R.J.2
  • 8
    • 38249012967 scopus 로고
    • A representation of the set of feasible objectives in multiple objective linear programs
    • Dauer, J. P., O. A. Saleh. 1992. A representation of the set of feasible objectives in multiple objective linear programs. Linear Algebra and Its Appl. 166 261-275.
    • (1992) Linear Algebra and Its Appl , vol.166 , pp. 261-275
    • Dauer, J.P.1    Saleh, O.A.2
  • 10
    • 0007216405 scopus 로고
    • Finding all efficient extreme points for multiple objective linear programs
    • Ecker, J. G., I. A. Kouada. 1978. Finding all efficient extreme points for multiple objective linear programs. Math. Programming 14(2) 249-261.
    • (1978) Math. Programming , vol.14 , Issue.2 , pp. 249-261
    • Ecker, J.G.1    Kouada, I.A.2
  • 11
    • 0000737982 scopus 로고
    • Generating all maximal efficient faces for multiple objective linear programs
    • Ecker, J. G., N. S. Hegner, I. A. Kouada. 1980. Generating all maximal efficient faces for multiple objective linear programs. J. Optim. Theory Appl. 30(3) 353-381.
    • (1980) J. Optim. Theory Appl , vol.30 , Issue.3 , pp. 353-381
    • Ecker, J.G.1    Hegner, N.S.2    Kouada, I.A.3
  • 12
    • 0002984987 scopus 로고
    • A revised simplex method for linear multiple objective programs
    • Evans, J. P., R. E. Steuer. 1973. A revised simplex method for linear multiple objective programs. Math. Programming 5 54-72.
    • (1973) Math. Programming , vol.5 , pp. 54-72
    • Evans, J.P.1    Steuer, R.E.2
  • 13
    • 1042292806 scopus 로고    scopus 로고
    • An information-theoretic metric for assessing multi-objective optimisation solution set quality
    • Farhang-Mehr, A., S. Azarm. 2003a. An information-theoretic metric for assessing multi-objective optimisation solution set quality. Trans. ASME, J. Mech. Design 125(4) 655-663.
    • (2003) Trans. ASME, J. Mech. Design , vol.125 , Issue.4 , pp. 655-663
    • Farhang-Mehr, A.1    Azarm, S.2
  • 14
    • 35248856421 scopus 로고    scopus 로고
    • Minimal sets of quality metrics
    • C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb, L. Thiele, eds. Evolutionary Multi-Criterion Optim, Second Internat. Conf, EMO, Faro, Portugal, Springer-Verlag, Berlin/Heidelberg
    • Farhang-Mehr, A., S. Azarm. 2003b. Minimal sets of quality metrics. C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb, L. Thiele, eds. Evolutionary Multi-Criterion Optim., Second Internat. Conf, EMO 2003, Faro, Portugal. Lecture Notes in Computer Science, Vol. 2632. Springer-Verlag, Berlin/Heidelberg, 405-417.
    • (2003) Lecture Notes in Computer Science , vol.2632 , pp. 405-417
    • Farhang-Mehr, A.1    Azarm, S.2
  • 15
    • 35248897594 scopus 로고    scopus 로고
    • The measure of Pareto optima: Applications to multiobjective metaheuristics
    • C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb, L. Thiele, eds. Evolutionary Multi-Criterion Optim, Second Internat. Conf, EMO 2003, Faro, Portugal, Springer-Verlag, Berlin/Heidelberg
    • Fleischer, M. 2003. The measure of Pareto optima: Applications to multiobjective metaheuristics. C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb, L. Thiele, eds. Evolutionary Multi-Criterion Optim., Second Internat. Conf, EMO 2003, Faro, Portugal. Lecture Notes in Computer Science, Vol. 2632. Springer-Verlag, Berlin/Heidelberg, 519-533.
    • (2003) Lecture Notes in Computer Science , vol.2632 , pp. 519-533
    • Fleischer, M.1
  • 16
    • 2042520404 scopus 로고    scopus 로고
    • An efficient sampling approach to multiobjective optimization
    • Fu, Y., U. M. Diwekar. 2004. An efficient sampling approach to multiobjective optimization. Ann. Oper: Res. 132 109-134.
    • (2004) Ann. Oper: Res , vol.132 , pp. 109-134
    • Fu, Y.1    Diwekar, U.M.2
  • 17
    • 0141796555 scopus 로고    scopus 로고
    • Quality-assisted multi-objective multidisciplinary genetic algorithms
    • Gunawan, S., S. Azarm, J. Wu. 2003. Quality-assisted multi-objective multidisciplinary genetic algorithms. AIAA J. 41(9) 1752-1762.
    • (2003) AIAA J , vol.41 , Issue.9 , pp. 1752-1762
    • Gunawan, S.1    Azarm, S.2    Wu, J.3
  • 18
    • 0038533340 scopus 로고
    • Multiple objective decision making-methods and applications: A state of the art survey
    • Springer-Verlag, Berlin
    • Hwang, C. L., A. Masud. 1979. Multiple objective decision making-methods and applications: A state of the art survey. Lecture Notes in Economics and Mathematical Systems, Vol. 164. Springer-Verlag, Berlin, 9-10.
    • (1979) Lecture Notes in Economics and Mathematical Systems , vol.164 , pp. 9-10
    • Hwang, C.L.1    Masud, A.2
  • 20
    • 0344183121 scopus 로고    scopus 로고
    • A heuristic approach to bicriteria scheduling
    • Koksalan, M. M. 1999. A heuristic approach to bicriteria scheduling. Naval Res. Logist. 46 777-789.
    • (1999) Naval Res. Logist , vol.46 , pp. 777-789
    • Koksalan, M.M.1
  • 21
    • 0000014259 scopus 로고
    • Interactive approaches for discrete alternative multiple criteria decision making with monotone utility functions
    • Koksalan, M. M., P. N. S. Sagala. 1995. Interactive approaches for discrete alternative multiple criteria decision making with monotone utility functions. Management Sci. 41(7) 1158-1171.
    • (1995) Management Sci , vol.41 , Issue.7 , pp. 1158-1171
    • Koksalan, M.M.1    Sagala, P.N.S.2
  • 23
    • 0004267646 scopus 로고
    • Princeton University Press, Princeton, NJ
    • Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
    • (1970) Convex Analysis
    • Rockafellar, R.T.1
  • 24
    • 23844480435 scopus 로고    scopus 로고
    • Approximation methods in multiobjective programming
    • Ruzika, S., M. M. Wiecek. 2005. Approximation methods in multiobjective programming. J. Optim. Theory Appl. 126(3) 473-501.
    • (2005) J. Optim. Theory Appl , vol.126 , Issue.3 , pp. 473-501
    • Ruzika, S.1    Wiecek, M.M.2
  • 25
    • 0030213057 scopus 로고    scopus 로고
    • An algorithm, based on facial decomposition for finding the efficient set in multiple objective linear programming
    • Sayin, S. 1996. An algorithm, based on facial decomposition for finding the efficient set in multiple objective linear programming. Oper. Res. Lett. 19 87-94.
    • (1996) Oper. Res. Lett , vol.19 , pp. 87-94
    • Sayin, S.1
  • 26
    • 0012932582 scopus 로고    scopus 로고
    • Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
    • Sayin, S. 2000. Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Programming 87 543-560.
    • (2000) Math. Programming , vol.87 , pp. 543-560
    • Sayin, S.1
  • 27
    • 4344616590 scopus 로고    scopus 로고
    • A procedure to find discrete representations of the efficient set with specified coverage errors
    • Sayin, S. 2003. A procedure to find discrete representations of the efficient set with specified coverage errors. Oper. Res. 51(3) 427-436.
    • (2003) Oper. Res , vol.51 , Issue.3 , pp. 427-436
    • Sayin, S.1
  • 30
    • 0028526191 scopus 로고
    • Random problem, generation and the computation of efficient extreme points in multiple objective linear programming
    • Steuer, R. E. 1994, Random problem, generation and the computation of efficient extreme points in multiple objective linear programming. Comput. Optim. Appl. 3 333-347.
    • (1994) Comput. Optim. Appl , vol.3 , pp. 333-347
    • Steuer, R.E.1
  • 31
    • 0002900909 scopus 로고
    • Intra-set point generation and filtering in decision and criterion space
    • Steuer, R. E., F. W. Harris. 1980. Intra-set point generation and filtering in decision and criterion space. Comput. Oper. Res. 7 41-53.
    • (1980) Comput. Oper. Res , vol.7 , pp. 41-53
    • Steuer, R.E.1    Harris, F.W.2
  • 32
    • 0000417016 scopus 로고
    • The use of reference objective in multiobjective optimization
    • G. Fandel, T. Gal, eds, Springer-Verlag, Berlin
    • Wierzbicki, A. 1980. The use of reference objective in multiobjective optimization. G. Fandel, T. Gal, eds. Multiple Criteria Decision Making, Theory and Application. Springer-Verlag, Berlin, 468-486.
    • (1980) Multiple Criteria Decision Making, Theory and Application , pp. 468-486
    • Wierzbicki, A.1
  • 33
    • 0001823017 scopus 로고    scopus 로고
    • Metrics for quality assessment of a multiobjective design optimization solution set
    • Wu, J., S. Azarm. 2001. Metrics for quality assessment of a multiobjective design optimization solution set. Trans. ASME, J. Mech. Design 123 18-25.
    • (2001) Trans. ASME, J. Mech. Design , vol.123 , pp. 18-25
    • Wu, J.1    Azarm, S.2
  • 34
    • 0016470076 scopus 로고
    • The set of all nondominated solutions in linear cases and a multicriteria simplex method
    • Yu, P. L., M. Zeleny. 1975. The set of all nondominated solutions in linear cases and a multicriteria simplex method. J. Math. Anal. Appl. 49 430-468.
    • (1975) J. Math. Anal. Appl , vol.49 , pp. 430-468
    • Yu, P.L.1    Zeleny, M.2
  • 35
    • 84878545782 scopus 로고    scopus 로고
    • Multiobjective optimization using evolutionary algorithms-A comparative case study
    • T. Baeck, A. Eiben, M. Schoenauer, H. Schwefel, eds. Proc. Fifth Internat. Conf Parallel Problem Solving from Nature-PPSN, Amsterdam, Springer-Verlag, Berlin/Heidelberg
    • Zitzler, E., L. Thiele. 1998. Multiobjective optimization using evolutionary algorithms-A comparative case study. T. Baeck, A. Eiben, M. Schoenauer, H. Schwefel, eds. Proc. Fifth Internat. Conf Parallel Problem Solving from Nature-PPSN, Amsterdam. Lecture Notes in Computer-Science, Vol. 1498. Springer-Verlag, Berlin/Heidelberg, 292-301.
    • (1998) Lecture Notes in Computer-Science , vol.1498 , pp. 292-301
    • Zitzler, E.1    Thiele, L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.