Primal and dual algorithms for optimization over the efficient set

References

• Ehrgott M, Naujoks B, Stewart TJ, et al. Multiple criteria decision making for sustainable energy and transportation systems. Lecture notes in economics and mathematical systems. Vol. 634. Berlin: Springer; 2010.
   Google Scholar
• Markowitz H. Portfolio selection. J Finance. 1952;7(1):77–91.
   Web of Science ®Google Scholar
• Ehrgott M, Güler Ç, Hamacher HW, et al. Mathematical optimization in intensity modulated radiation therapy. Ann Oper Res. 2009;175(1):309–365. doi: 10.1007/s10479-009-0659-4
   Web of Science ®Google Scholar
• Hamel AH, Löhne A, Rudloff B. Benson type algorithms for linear vector optimization and applications. J Global Optim. 2014;59(4):811–836. doi: 10.1007/s10898-013-0098-2
   Web of Science ®Google Scholar
• Benson HP. An all-linear programming relaxation algorithm for optimizing over the efficient set. J Global Optim. 1991;1(1):83–104. doi: 10.1007/BF00120667
   Google Scholar
• Fülöp J, Muu LD. Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem. J Optim Theory Appl. 2000;105(1):37–54. doi: 10.1023/A:1004657827134
   Web of Science ®Google Scholar
• Horst R, Tuy H. Global optimization: deterministic approaches. Berlin: Springer; 1993.
   Google Scholar
• Thoai NV. Conical algorithm in global optimization for optimizing over efficient sets. J Global Optim. 2000;18(4):321–336. doi: 10.1023/A:1026544116333
   Web of Science ®Google Scholar
• Yamamoto Y. Optimization over the efficient set: overview. J Global Optim. 2002;22(1–4):285–317. doi: 10.1023/A:1013875600711
   Web of Science ®Google Scholar
• Fülöp J. On the equivalency between a linear bilevel programming problem and linear optimization over the efficient set. Hungarian Academy of Sciences; 1993. Technical report.
   Google Scholar
• Ehrgott M. Multicriteria optimization. 2nd ed. Berlin: Springer; 2005.
   Google Scholar
• Dauer JP. Analysis of the objective space in multiple objective linear programming. J Math Anal Appl. 1987;126(2):579–593. doi: 10.1016/0022-247X(87)90065-5
   Web of Science ®Google Scholar
• Dauer JP. On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program. Ann Oper Res. 1993;46–47(2):279–292. doi: 10.1007/BF02023100
   Google Scholar
• Benson HP. A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions. J Global Optim. 1995;6(3):231–251. doi: 10.1007/BF01099463
   Web of Science ®Google Scholar
• Benson HP. An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J Global Optim. 1998;13:1–24. doi: 10.1023/A:1008215702611
   Web of Science ®Google Scholar
• Ehrgott M, Löhne A, Shao L. A dual variant of benson's outer approximation algorithm for multiple objective linear programming. J Global Optim. 2011;52(4):757–778. doi: 10.1007/s10898-011-9709-y
   Web of Science ®Google Scholar
• Ehrgott M, Wiecek M. Mutiobjective programming. In: Figueira J, Greco S, Ehrgott M, editors. Multiple criteria decision analysis: state of the art surveys. New York (NY): Springer; 2005. p. 667–708. (International Series in Operations Research and Management Science; Vol. 78).
   Google Scholar
• Heyde F, Löhne A. Geometric duality in multiple objective linear programming. SIAM J Optim. 2008;19(2):836–845. doi: 10.1137/060674831
   Web of Science ®Google Scholar
• Löhne A, Rudloff B, Ulus F. Primal and dual approximation algorithms for convex vector optimization problems. J Global Optim. 2014;60(4):713–736. doi: 10.1007/s10898-013-0136-0
   Web of Science ®Google Scholar
• Benson HP, Lee D. Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem. J Optim Theory Appl. 1996;88(1):77–105. doi: 10.1007/BF02192023
   Web of Science ®Google Scholar
• Kim NTB, Thang TN. Optimization over the efficient set of a bicriteria convex programming problem. Pac J Optim. 2013;9:103–115.
   Web of Science ®Google Scholar
• Benson HP. An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem. J Global Optim. 2011;52(3):553–574. doi: 10.1007/s10898-011-9786-y
   Web of Science ®Google Scholar
• Benson HP. Optimization over the efficient set. J Math Anal Appl. 1984;98(2):562–580. doi: 10.1016/0022-247X(84)90269-5
   Web of Science ®Google Scholar
• Yu P-L. Multiple-criteria decision making: concepts, techniques, and extensions). New York (NY): Plenum Press; 1985. (Mathematical Concepts and Methods in Science and Engineering; Vol. 30).
   Google Scholar
• Fruhwirth M, Mekelburg K. On the efficient point set of tricriteria linear programs. Eur J Oper Res. 1994;72:192–199. doi: 10.1016/0377-2217(94)90340-9
   Web of Science ®Google Scholar
• Charnes A, Raike WM, Stutz JD, et al. On generation of test problems for linear programming codes. Commun ACM. 1974;17(10):583–586. doi: 10.1145/355620.361173
   Web of Science ®Google Scholar