Criteria and dimension reduction of linear multiple criteria optimization problems |
| |
Authors: | Nguyen V Thoai |
| |
Institution: | 1.Department of Mathematics,University of Trier,Trier,Germany |
| |
Abstract: | Two of the main approaches in multiple criteria optimization are optimization over the efficient set and utility function
program. These are nonconvex optimization problems in which local optima can be different from global optima. Existing global
optimization methods for solving such problems can only work well for problems of moderate dimensions. In this article, we
propose some ways to reduce the number of criteria and the dimension of a linear multiple criteria optimization problem. By
the concept of so-called representative and extreme criteria, which is motivated by the concept of redundant (or nonessential)
objective functions of Gal and Leberling, we can reduce the number of criteria without altering the set of efficient solutions.
Furthermore, by using linear independent criteria, the linear multiple criteria optimization problem under consideration can
be transformed into an equivalent linear multiple criteria optimization problem in the space of linear independent criteria.
This equivalence is understood in a sense that efficient solutions of each problem can be derived from efficient solutions
of the other by some affine transformation. As a result, such criteria and dimension reduction techniques could help to increase
the efficiency of existing algorithms and to develop new methods for handling global optimization problems arisen from multiple
objective optimization. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|