Detecting local convexity on the pareto surface

Journal of Multi-Criteria Decision Analysis

Volumn 11, Issue 1, 2002, Pages 45-54

  Fadel, Georges ^a   Li, Yusheng ^a   Konda, Suman ^a   Wiecek, Margaret M ^b   Ruzika, Stefan ^a  

^a AMRL   (United States)

^b CLEMSON UNIVERSITY   (United States)

Author keywords

Convexity; Multi criteria optimization; Pareto set; Tchebycheff method; Weighting method

Indexed keywords

EID: 20344380259     PISSN: 10579214     EISSN: 10991360     Source Type: Journal    
DOI: 10.1002/mcda.315     Document Type: Article

References (11)

1. Bazaraa, MS., Sherali, H-D., Shetty, CM., 1993. Nonlinear Programming: Theory and Algorithms. Wiley: New York.
2. Benson, HP., 1978. Existence of efficient solutions for vector maximization problems. Journal of Optimization Theory and Applications 26: 569-580.
3. Das, I., 1999. On characterizing the ‘knee’ of the Pareto curve based on normal-boundary intersection. Structural Optimization 18 (2/3): 107-115.
4. Geoffrion, AM., 1968. Proper efficiency and theory of vector maximization. Journal of Mathematical Analysis and Applications 22: 618-630.
5. Fadel, G., Li, Y., 2002. Approximating the Pareto curve to help solve bi-objective design problems. Structural Optimization Journal 23(6): 280-296.
6. Li, Y., 1999. Approximating the Pareto set of convex bi-criteria optimization problems to aid decision making in design. Ph.D. Thesis, Clemson University.
7. Li, Y., Fadel, GM., Wiecek, MM., Blouin, V., 2002. Minimum effort approximation of the Pareto space of convex bi-criteria problems. Optimization and Engineering, submitted
8. Messac, A., Sundararaj, GJ., Tappeta, RV., Renaud, JE., 2000. The ability of objective functions to generate non-convex Pareto frontiers. AIAA Journal 38(6): 1084-1091.
9. Sawaragi, Y., Nakayama, H., Tanino, T., 1985. Theory of Multiobjective Optimization. Academic Press: Orlando.
10. Steuer, RE., 1986. Multiple Criteria Optimization: Theory, Computation and Application. Wiley: New York.
11. Tind, J., Wiecek, MM., 1999. Augmented Lagrangian and Tchebycheff approaches in multiple objective programming. Journal of Global Optimization 14: 251-266.