A NOTE ON WEIGHTED CRITERIA METHODS FOR COMPROMISE SOLUTIONS IN MULTI-OBJECTIVE OPTIMIZATION
- 1 September 1996
- journal article
- research article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 27 (2) , 155-176
- https://doi.org/10.1080/03052159608941404
Abstract
A common multi-objective optimization approach forms the objective function from linearly weighted criteria. It is known that the method can fail to capture Pareto optimal points in a non-convex attainable region. This note considers generalized weighted criteria methods that retain the advantages of the linear method without suffering from this limitation. Compromise programming and a new method with exponentially weighted criteria are evaluated. Demonstration on design problems is included.Keywords
This publication has 7 references indexed in Scilit:
- Multicriteria Optimization in Engineering and in the SciencesPublished by Springer Nature ,1988
- NLPQL: A fortran subroutine solving constrained nonlinear programming problemsAnnals of Operations Research, 1986
- Defectiveness of weighting method in multicriterion optimization of structuresCommunications in Applied Numerical Methods, 1985
- Connectedness of the set of nondominated outcomes in multicriteria optimizationJournal of Optimization Theory and Applications, 1978
- An Iterative Approach to Goal ProgrammingJournal of the Operational Research Society, 1977
- Goal programming and multiple objective optimizationsEuropean Journal of Operational Research, 1977
- Maximal vectors and multi-objective optimizationJournal of Optimization Theory and Applications, 1976