Convexification of a noninferior frontier

作者: D. Li

DOI: 10.1007/BF02192028

关键词:

摘要: The convexity of a noninferior frontier can be achieved in an appropriate equivalent objective space for general nonconvex multi-objective optimization problems. Specifically, this paper proves that applying thep-power to the functions act as convexification scheme frontier.

参考文章(12)
Quan Zheng, Efim A. Galperin, Global solutions in optimal control and games NP Research Pub. : Presses de l'Université de Québec. ,(1991)
Saul Gass, Thomas Saaty, The computational algorithm for the parametric objective function Naval Research Logistics Quarterly. ,vol. 2, pp. 39- 45 ,(1955) , 10.1002/NAV.3800020106
D. Li, Iterative Parametric Dynamic Programming and Its Application in Reliability Optimization Journal of Mathematical Analysis and Applications. ,vol. 191, pp. 589- 607 ,(1995) , 10.1006/JMAA.1995.1150
P. L. Yu, G. Leitmann, Compromise Solutions, Domination Structures, and Salukvadze’s Solution Multicriteria Decision Making and Differential Games. ,vol. 13, pp. 85- 101 ,(1976) , 10.1007/978-1-4615-8768-2_4
D.J. White, Weighting factor extensions for finite multiple objective vector minimization problems European Journal of Operational Research. ,vol. 36, pp. 256- 265 ,(1988) , 10.1016/0377-2217(88)90433-X
H. P. Benson, T. L. Morin, The Vector Maximization Problem: Proper Efficiency and Stability SIAM Journal on Applied Mathematics. ,vol. 32, pp. 64- 72 ,(1977) , 10.1137/0132004
L. Zadeh, Optimality and non-scalar-valued performance criteria IEEE Transactions on Automatic Control. ,vol. 8, pp. 59- 60 ,(1963) , 10.1109/TAC.1963.1105511
Arthur M Geoffrion, Proper efficiency and the theory of vector maximization Journal of Mathematical Analysis and Applications. ,vol. 22, pp. 618- 630 ,(1968) , 10.1016/0022-247X(68)90201-1