메뉴 건너뛰기




Volumn 52, Issue 4, 2012, Pages 757-778

A dual variant of Benson's "outer approximation algorithm" for multiple objective linear programming

Author keywords

Duality; Linear programming; Multiobjective optimization; Objective space; Outer approximation; Vector optimization

Indexed keywords

DUALITY; MULTIPLE OBJECTIVE LINEAR PROGRAMMING; MULTIPLE-OBJECTIVES; NON-DOMINATED POINTS; OBJECTIVE SPACE; OUTER APPROXIMATION; OUTER APPROXIMATION ALGORITHM; VECTOR OPTIMIZATIONS;

EID: 84872614531     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-011-9709-y     Document Type: Article
Times cited : (72)

References (25)
  • 1
    • 0032347070 scopus 로고    scopus 로고
    • Further analysis of an outcome set-based algorithm for multiple-objective linear programming
    • 10.1023/A:1022614814789
    • Benson H.P.: Further analysis of an outcome set-based algorithm for multiple-objective linear programming. J. Optim. Theory Appl. 97(1), 1-10 (1998)
    • (1998) J. Optim. Theory Appl. , vol.97 , Issue.1 , pp. 1-10
    • Benson, H.P.1
  • 2
    • 0002035405 scopus 로고    scopus 로고
    • An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
    • 10.1023/A:1008215702611
    • Benson H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Glob. Optim. 13, 1-24 (1998)
    • (1998) J. Glob. Optim. , vol.13 , pp. 1-24
    • Benson, H.P.1
  • 3
    • 0034349259 scopus 로고    scopus 로고
    • Outcome space partition of the weight set in multiobjective linear programming
    • 10.1023/A:1004605810296
    • Benson H.P.; Sun E.: Outcome space partition of the weight set in multiobjective linear programming. J. Optim. Theory Appl. 105(1), 17-36 (2000)
    • (2000) J. Optim. Theory Appl. , vol.105 , Issue.1 , pp. 17-36
    • Benson, H.P.1    Sun, E.2
  • 4
    • 0000949397 scopus 로고
    • On-line and off-line vertex enumeration by adjacency lists
    • 10.1016/0167-6377(91)90042-N
    • Chen P.C.; Hansen P.; Jaumard B.: On-line and off-line vertex enumeration by adjacency lists. Oper. Res. Lett. 10, 403-409 (1991)
    • (1991) Oper. Res. Lett. , vol.10 , pp. 403-409
    • Chen, P.C.1    Hansen, P.2    Jaumard, B.3
  • 5
    • 34547282708 scopus 로고    scopus 로고
    • A survey of recent developments in multiobjective optimization
    • 10.1007/s10479-007-0186-0
    • Chinchuluun A.; Pardalos P.: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 154, 29-50 (2007)
    • (2007) Ann. Oper. Res. , vol.154 , pp. 29-50
    • Chinchuluun, A.1    Pardalos, P.2
  • 10
    • 67649563554 scopus 로고    scopus 로고
    • Geometric duality in multiple objective linear programming
    • 10.1137/060674831
    • Heyde F.; Löhne A.: Geometric duality in multiple objective linear programming. SIAM J. Optim. 19(2), 836-845 (2008)
    • (2008) SIAM J. Optim. , vol.19 , Issue.2 , pp. 836-845
    • Heyde, F.1    Löhne, A.2
  • 11
    • 58849104050 scopus 로고    scopus 로고
    • Set-valued duality theory for multiple objective linear programs and application to mathematical finance
    • 10.1007/s00186-008-0216-y
    • Heyde F.; Löhne A.; Tammer C.: Set-valued duality theory for multiple objective linear programs and application to mathematical finance. Math. Methods Oper. Res. 69(1), 159-179 (2009)
    • (2009) Math. Methods Oper. Res. , vol.69 , Issue.1 , pp. 159-179
    • Heyde, F.1    Löhne, A.2    Tammer, C.3
  • 12
    • 0000583822 scopus 로고
    • Proper efficiency and the linear vector maximum problem
    • 10.1287/opre.22.1.189
    • Isermann H.: Proper efficiency and the linear vector maximum problem. Oper. Res. 22, 189-191 (1974)
    • (1974) Oper. Res. , vol.22 , pp. 189-191
    • Isermann, H.1
  • 13
    • 0002429095 scopus 로고
    • On some relations between a dual pair of multiple objective linear programs
    • 10.1007/BF01917642
    • Isermann H.: On some relations between a dual pair of multiple objective linear programs. Zeitschrift. Oper. Res. 22, 33-41 (1978)
    • (1978) Zeitschrift. Oper. Res. , vol.22 , pp. 33-41
    • Isermann, H.1
  • 15
    • 0016358683 scopus 로고
    • Duality, indifference and sensitivity analysis in multiple objective linear programming
    • 10.1057/jors.1974.108
    • Kornbluth J.S.H.: Duality, indifference and sensitivity analysis in multiple objective linear programming. Oper. Res. Q. 25(4), 599-614 (1974)
    • (1974) Oper. Res. Q. , vol.25 , Issue.4 , pp. 599-614
    • Kornbluth, J.S.H.1
  • 17
    • 77955482788 scopus 로고    scopus 로고
    • A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer program
    • 10.1287/ijoc.1090.0342 10.1287/ijoc.1090.0342
    • Przybylski A.; Gandibleux X.; Ehrgott M.: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer program. INFORMS J. Comput. 22, 371-386 (2010). doi: 10.1287/ijoc.1090.0342
    • (2010) INFORMS J. Comput. , vol.22 , pp. 371-386
    • Przybylski, A.1    Gandibleux, X.2    Ehrgott, M.3
  • 18
    • 0004267646 scopus 로고
    • Princeton University Press Princeton
    • Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1972)
    • (1972) Convex Analysis
    • Rockafellar, R.T.1
  • 19
    • 53149132409 scopus 로고    scopus 로고
    • Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
    • 10.1007/s00186-008-0220-2
    • Shao L.; Ehrgott M.: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning. Math. Methods Oper. Res. 68(2), 257-276 (2008)
    • (2008) Math. Methods Oper. Res. , vol.68 , Issue.2 , pp. 257-276
    • Shao, L.1    Ehrgott, M.2
  • 20
    • 56749181012 scopus 로고    scopus 로고
    • Approximating the nondominated set of an molp by approximately solving its dual problem
    • 10.1007/s00186-007-0194-5
    • Shao L.; Ehrgott M.: Approximating the nondominated set of an molp by approximately solving its dual problem. Math. Methods Oper. Res. 68, 469-492 (2008)
    • (2008) Math. Methods Oper. Res. , vol.68 , pp. 469-492
    • Shao, L.1    Ehrgott, M.2
  • 22
    • 0003663801 scopus 로고
    • Adbase multiple objective linear programming package
    • Athens, Georgia
    • Steuer, R.E.: Adbase multiple objective linear programming package. Technical report, University of Georgia, Athens, Georgia (1989)
    • (1989) Technical Report, University of Georgia
    • Steuer, R.E.1
  • 23
    • 0013458646 scopus 로고
    • The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems
    • Ulungu E.L.; Teghem J.: The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Found. Comput. Decis. Sci. 20, 149-165 (1995)
    • (1995) Found. Comput. Decis. Sci. , vol.20 , pp. 149-165
    • Ulungu, E.L.1    Teghem, J.2
  • 24
    • 0004145937 scopus 로고
    • Oxford University Press, Oxford Science Publications Oxford
    • Webster R.: Convexity. Oxford University Press, Oxford Science Publications, Oxford (1994)
    • (1994) Convexity
    • Webster, R.1


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