[1] Aghezzaf B, Ouaderhman T. An interactive interior point algorithm for multiobjective linear programming problems. Operations Research Letters, 2001, 29: 163--170
[2] Brusco M J, Stahl S. An interactive multi-objective programming: approach to combinatorial data analysis. Psychometrika, 2001, 66(1): 5--24
[3] Chankong V, Haimes Y Y. Multiobjective Decision Making Theory and Methodology. New York, Amsterdam, Oxford: North-Holland, 1983
[4] Das I, Dennis J E. Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim, 1998, 8: 631--657
[5] Fiacco A V, Mccormick G P. The sequential unconstrained minimization technique ithout parameters. Operations Research, 1967, 15: 820--827
[6] Fiacco A V, Mccormick G P. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. New York: John Wiley and Sons, 1968
[7] Huard P. The method of centers//Abadie J, ed. Nonlinear Programming. msterdam: North-Holland Publ Co, 1967
[8] Huard P. Programmation mathematique convex. RIRO, R7, 1968: 43--59
[9] Jorg Fliege. An efficient interior-point method for convex multicriteria optimization problems. Mathematics of Operations Research, 2006, 31(4): 825--845
[10] Messac A. Physical programming: effective optimization for computational design. AIAA J, 1996, 34: 149--158
[11] Messac A, Ismail-Yahaya A, Mattson C A. The normalized normal constraint method for generating the pareto frontier. Structural and Multidisciplinary Optimization, 2003, 25(2): 86--98
[12] Mifflin R. Convergence bounds for nonlinear programming algorithms. Mathematical Programming, 1975, 8: 251--271
[13] Mifflin R. Rates of convergence for a method of centers algorithm. Journal of Optimization Theory and Application, 1976, 18: 199--228
[14] Nabetani K. Variational Inequality Approaches to Generalized Nash Equilibrium Problems
[D]. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, 2008
[15] Rockafellar R T. Convex Analysis. Princeton: Princeton University Press, 1970
[16] Steuer R. Multiple Criteria Optimization: Theory, Computation, and Applications. New York: John Wiley & Sons, 1986
[17] Trafalis T, Morin T L, Abhyankar S S. Efficient Faces of Polytopes: Interior Point Algorithms, Parametrization of Algebraic Varieties, and Multiple Objective Optimization//Contemp Math, 114. AMS, 1991: 319--341
[18] Wiecek M, Chen W, Zhang J. Piecewise quadratic approximation of the nondominated set for bicriteria programs. Journal of Multicriteria Decision Analysis, 2001, 10: 35--47
[19] Youness E A. Characterization of efficient solutions of multi-objective E-convex programming problems. Applied Mathematics and Computation, 2004, 151: 755--761
[20] Youness E A. Emam T. Characterization of efficient solutions of multi-objective optimization problems involving semi-strongly and generalized semi-strongly E-convexity. Acta Mathematica Scientia, 2008, 28B(1): 7--16
|