메뉴 건너뛰기




Volumn 52, Issue 3, 2012, Pages 499-508

Criteria and dimension reduction of linear multiple criteria optimization problems

Author keywords

Criteria reduction; Dimension reduction; Global optimization; Multicriteria optimization; Optimization over the efficient set; Utility function programs

Indexed keywords

AFFINE TRANSFORMATIONS; DIMENSION REDUCTION; DIMENSION REDUCTION TECHNIQUES; EFFICIENT SETS; EQUIVALENT-LINEAR; GLOBAL OPTIMIZATION METHOD; GLOBAL OPTIMIZATION PROBLEMS; GLOBALOPTIMUM; LOCAL OPTIMA; MULTICRITERIA OPTIMIZATION; MULTIPLE CRITERIA OPTIMIZATION; MULTIPLE-OBJECTIVE OPTIMIZATION; NONCONVEX OPTIMIZATION PROBLEM; OBJECTIVE FUNCTIONS; UTILITY FUNCTIONS;

EID: 84859268493     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-011-9764-4     Document Type: Article
Times cited : (12)

References (43)
  • 1
    • 0031142874 scopus 로고    scopus 로고
    • On redundancy in multi criteria decision making
    • Agrell, P.J.: On redundancy in multi criteria decision making. Eur. J. Oper. Res. 98, 571-586 (1997) (Pubitemid 127392244)
    • (1997) European Journal of Operational Research , vol.98 , Issue.3 , pp. 571-586
    • Agrell, P.J.1
  • 2
    • 0024716457 scopus 로고
    • Redundancy in lexicographic goal programming: An empirical approach
    • Amador, F., Romero, C.: Redundancy in lexicographic goal programming: an empirical approach. Eur. J. Oper. Res. 41, 347-354 (1989)
    • (1989) Eur. J. Oper. Res. , vol.41 , pp. 347-354
    • Amador, F.1    Romero, C.2
  • 3
    • 0021371645 scopus 로고
    • Optimization over the efficient set
    • Benson, H.P.: Optimization over the efficient set. J. Math. Anal. Appl. 98, 562-580 (1984)
    • (1984) J. Math. Anal. Appl. , vol.98 , pp. 562-580
    • Benson, H.P.1
  • 4
    • 0002393742 scopus 로고
    • An all-linear programming relaxation algorithm for optimizing over the efficient set
    • Benson, H.P.: An all-linear programming relaxation algorithm for optimizing over the efficient set. J. Glob. Optim. 1, 83-104 (1991)
    • (1991) J. Glob. Optim. , vol.1 , pp. 83-104
    • Benson, H.P.1
  • 5
    • 34249762064 scopus 로고
    • A geometrical analysis of the outcome set in multiple objective convex programs with linear criterion functions
    • Benson, H.P.: A geometrical analysis of the outcome set in multiple objective convex programs with linear criterion functions. J. Glob. Optim. 6, 231-251 (1995)
    • (1995) J. Glob. Optim. , vol.6 , pp. 231-251
    • Benson, H.P.1
  • 6
    • 0002035405 scopus 로고    scopus 로고
    • An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem
    • Benson, H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problems. J. Glob. Optim. 13, 1-24 (1998) (Pubitemid 128508071)
    • (1998) Journal of Global Optimization , vol.13 , Issue.1 , pp. 1-24
    • Benson, H.P.1
  • 7
    • 0030550247 scopus 로고    scopus 로고
    • Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
    • Benson, H.P., Lee, D.: Outcome-based algorithm for ptimizing over the efficient set of a bicriteria linear programming problem. J. Optim. Theory Appl. 88, 77-105 (1996) (Pubitemid 126322194)
    • (1996) Journal of Optimization Theory and Applications , vol.88 , Issue.1 , pp. 77-105
    • Benson, H.P.1    Lee, D.2
  • 8
    • 0034349259 scopus 로고    scopus 로고
    • Outcome space partition of weight set in multiobjective linear programming
    • Benson, H.P., Sun, E.: Outcome space partition of weight set in multiobjective linear programming. J. Optim. Theory Appl. 105, 17-36 (2000)
    • (2000) J. Optim. Theory Appl. , vol.105 , pp. 17-36
    • Benson, H.P.1    Sun, E.2
  • 9
    • 55749098297 scopus 로고    scopus 로고
    • Dimensionality reduction in multiobjective optimization: The minimum objective subset problem
    • Waldmann K.H., Stocker U.M. (eds.)
    • Brockhoff, D., Zitzler, E.: Dimensionality reduction in multiobjective optimization: the minimum objective subset problem, In: Waldmann K.H., Stocker U.M. (eds.) Operations Research Proceedings 2006, 423-429 (2007)
    • (2007) Operations Research Proceedings 2006 , pp. 423-429
    • Brockhoff, D.1    Zitzler, E.2
  • 10
    • 0001313365 scopus 로고
    • Optimization over the efficient set
    • Dauer, J.P., Fosnaugh, T.A.: Optimization over the efficient set. J. Glob. Optim. 7, 261-277 (1995)
    • (1995) J. Glob. Optim. , vol.7 , pp. 261-277
    • Dauer, J.P.1    Fosnaugh, T.A.2
  • 13
    • 0002986031 scopus 로고
    • A cutting plane algorithm for linear optimization over the efficient set, generalized convexity
    • Komlösi S., Rapcsàk T., Schaible S. (eds.) , Springer, Berlin, Germany
    • Fülöp, J.: A cutting plane algorithm for linear optimization over the efficient set, generalized convexity. In: Komlösi S., Rapcsàk T., Schaible S. (eds.) Lecture Notes in Economics and Mathematical Systems, vol. 405, 374-385, Springer, Berlin, Germany, (1994)
    • (1994) Lecture Notes in Economics and Mathematical Systems , vol.405 , pp. 374-385
    • Fülöp, J.1
  • 15
    • 0033337004 scopus 로고    scopus 로고
    • Consequences of dropping nonessential objectives for the application of MCDM methods
    • DOI 10.1016/S0377-2217(99)00139-3
    • Gal, T., Hanne, T.: Consequences of dropping nonessential objectives for the application of MCDM methods. Eur. J. Oper. Res. 119, 373-378 (1999) (Pubitemid 30518393)
    • (1999) European Journal of Operational Research , vol.119 , Issue.2 , pp. 373-378
    • Gal, T.1    Hanne, T.2
  • 16
    • 24944512590 scopus 로고    scopus 로고
    • Nonessential objectives within network approaches for MCDM
    • DOI 10.1016/j.ejor.2004.04.045, PII S0377221704003881
    • Gal, T., Hanne, T.: Nonessential objectives within network approaches forMCDM. Eur. J. Oper. Res. 168, 584-592 (2006) (Pubitemid 41329866)
    • (2006) European Journal of Operational Research , vol.168 , Issue.2 SPEC. ISSUE , pp. 584-592
    • Gal, T.1    Hanne, T.2
  • 17
    • 0017492688 scopus 로고
    • Redundant objective functions in linear vector maximum problems and their determination
    • Gal, T., Leberling, H.: Redundant objective functions in linear vector maximum problems and their determination. Eur. J. Oper. Res. 1, 176-184 (1977)
    • (1977) Eur. J. Oper. Res. , vol.1 , pp. 176-184
    • Gal, T.1    Leberling, H.2
  • 18
    • 84859266013 scopus 로고    scopus 로고
    • Nonessential objectives and network-based multicriteria decision making. in
    • Ferreira M., Menezes A.M.R., Catanas F. (eds.)
    • Hanne, T.: Nonessential objectives and network-based multicriteria decision making. In: Ferreira M., Menezes A.M.R., Catanas F. (eds.), Temas em metodos quantitativos, 4, 153-168 (2004)
    • (2004) Temas em Metodos Quantitativos , vol.4 , pp. 153-168
    • Hanne, T.1
  • 20
    • 0031523288 scopus 로고    scopus 로고
    • Utility function programs and optimization over the efficient set in multiple objective decision making
    • Horst, R., Thoai, N.V.: Utility function programs and optimization over the efficient set in multiple objective decision making. J. Optim. Theory Appl. 92, 469-486 (1997)
    • (1997) J. Optim. Theory Appl. , vol.92 , pp. 469-486
    • Horst, R.1    Thoai, N.V.2
  • 21
    • 0032639373 scopus 로고    scopus 로고
    • Maximizing a concave function over the efficient or weakly-efficient set
    • Horst, R., Thoai, N.V.: Maximizing a concave function over the efficient or weakly-efficient set. Eur. J. Oper. Res. 117, 239-252 (1999)
    • (1999) Eur. J. Oper. Res. , vol.117 , pp. 239-252
    • Horst, R.1    Thoai, N.V.2
  • 22
    • 36048964192 scopus 로고    scopus 로고
    • On optimization over the efficient set in linear multicriteria programming
    • Horst, R., Thoai, N.V., Yamamoto, Y., Zenke, D.: On optimization over the efficient set in linear multicriteria programming. J. Optim. Theory Appl. 134, 433-443 (2007)
    • (2007) J. Optim. Theory Appl. , vol.134 , pp. 433-443
    • Horst, R.1    Thoai, N.V.2    Yamamoto, Y.3    Zenke, D.4
  • 25
    • 0001290246 scopus 로고    scopus 로고
    • Numerical solution for optimization over the efficient set by d.c. optimization algorithms
    • DOI 10.1016/0167-6377(96)00022-3, PII S0167637796000223
    • Le-Thi, H.A., Pham, D.T., Muu, L.D.: Numerical solution for optimization over the efficient set by D.C. optimization algorithms. Oper. Res. Lett. 19, 117-128 (1996) (Pubitemid 126395356)
    • (1996) Operations Research Letters , vol.19 , Issue.3 , pp. 117-128
    • An, L.T.H.1    Tao, P.D.2    Muu, L.D.3
  • 26
    • 77957692770 scopus 로고    scopus 로고
    • Approximating the pareto optimal set using a reduced set of objective functions
    • Lindroth, P., Patriksson, M., Stömberg, A.B.: Approximating the pareto optimal set using a reduced set of objective functions. Eur. J. Oper. Res. 207, 1519-1534 (2010)
    • (2010) Eur. J. Oper. Res. , vol.207 , pp. 1519-1534
    • Lindroth, P.1    Patriksson, M.2    Stömberg, A.B.3
  • 27
    • 0038179144 scopus 로고    scopus 로고
    • Changes of the set of efficient solutions by extending the number of objectives and its evaluation
    • Malinowska, A.B.: Changes of the set of efficient solutions by extending the number of objectives and its evaluation. Control Cybern. 31, 964-974 (2002)
    • (2002) Control Cybern. , vol.31 , pp. 964-974
    • Malinowska, A.B.1
  • 28
    • 34547187689 scopus 로고    scopus 로고
    • Nonessential objective functions in linear multiobjective optimization problems
    • Malinowska, A.B.: Nonessential objective functions in linear multiobjective optimization problems. Control Cybern. 35, 873-880 (2006)
    • (2006) Control Cybern. , vol.35 , pp. 873-880
    • Malinowska, A.B.1
  • 29
    • 50249139576 scopus 로고    scopus 로고
    • Weakly and properly nonessential objectives inmultiobjective optimization problems
    • Malinowska, A.B.:Weakly and properly nonessential objectives inmultiobjective optimization problems. Oper. Res. Lett. 36, 647-650 (2008)
    • (2008) Oper. Res. Lett. , vol.36 , pp. 647-650
    • Malinowska, A.B.1
  • 30
    • 55649093921 scopus 로고    scopus 로고
    • Computational approach to essential and nonessential objective functions in linear multicriteria optimization
    • Malinowska, A.B., Torres, D.F.M.: Computational approach to essential and nonessential objective functions in linear multicriteria optimization. J. Optim. Theory Appl. 139, 577-590 (2008)
    • (2008) J. Optim. Theory Appl. , vol.139 , pp. 577-590
    • Malinowska, A.B.1    Torres, D.F.M.2
  • 31
    • 0001202830 scopus 로고    scopus 로고
    • On equivalence between convex maximization and optimization over the efficient set
    • Muu, L.D., Luc, L.T.: On equivalence between convex maximization and optimization over the efficient set. Vietnam J. Math. 24, 439-444 (1996)
    • (1996) Vietnam J. Math. , vol.24 , pp. 439-444
    • Muu, L.D.1    Luc, L.T.2
  • 34
    • 0001053761 scopus 로고
    • Algorithms for the vector maximization problem
    • Philip, J.: Algorithms for the vector maximization problem. Math. Program. 2, 207-229 (1972)
    • (1972) Math. Program. , vol.2 , pp. 207-229
    • Philip, J.1
  • 37
    • 0005704150 scopus 로고    scopus 로고
    • Conical algorithm in global optimization for optimizing over efficient sets
    • Thoai, N.V.: Conical algorithm in global optimization for optimizing over efficient sets. J. Glob. Optim. 18, 321-336 (2000)
    • (2000) J. Glob. Optim. , vol.18 , pp. 321-336
    • Thoai, N.V.1
  • 38
    • 0036245676 scopus 로고    scopus 로고
    • Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
    • DOI 10.1023/A:1014865432210
    • Thoai, N.V.: Convergence and application of a decompositionmethod using duality bounds for nonconvex global optimization. J. Optim. Theory Appl. 113, 165-193 (2002) (Pubitemid 39583369)
    • (2002) Journal of Optimization Theory and Applications , vol.113 , Issue.1 , pp. 165-193
    • Thoai, N.V.1
  • 39
    • 56649086442 scopus 로고    scopus 로고
    • Decomposition branch and bound algorithm for optimization problems over efficient sets
    • Thoai, N.V.: Decomposition branch and bound algorithm for optimization problems over efficient sets. J. Ind. Manag. Optim. 4, 647-660 (2008)
    • (2008) J. Ind. Manag. Optim. , vol.4 , pp. 647-660
    • Thoai, N.V.1
  • 40
    • 77958152603 scopus 로고    scopus 로고
    • Reverse convex programming approach in the space of extreme criteria for optimization over the efficient sets
    • Thoai, N.V.: Reverse convex programming approach in the space of extreme criteria for optimization over the efficient sets. J. Optim. Theory Appl. 147, 263-277 (2010)
    • (2010) J. Optim. Theory Appl. , vol.147 , pp. 263-277
    • Thoai, N.V.1
  • 41
    • 84938604116 scopus 로고    scopus 로고
    • Optimization over the efficient set: Overview
    • Yamamoto, Y.: Optimization over the efficient set: overview. J. Glob. Optim. 22, 285-317 (2002)
    • (2002) J. Glob. Optim. , vol.22 , pp. 285-317
    • Yamamoto, Y.1
  • 43
    • 77957053582 scopus 로고
    • Nemhauser G.L., Rinnooy Kan, A.H.G., Todd, M.J. (eds.) Optimization. Amsterdam North-Holland
    • Yu, P.L.: Multiple criteria decision making: five basic concepts. In: Nemhauser, G.L., Rinnooy Kan, A.H.G., Todd, M.J. (eds.) Optimization, pp. 663-699. Amsterdam, North-Holland (1989)
    • (1989) Multiple Criteria Decision Making: Five Basic Concepts , pp. 663-699
    • Yu, P.L.1


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