The aim of this paper is to answer the open question of Wang and Parkan (Information Sciences 175 (2005), 20¿29) that the solutions of maximum entropy OWA operator problem under given orness level and the minimax disparity OWA operator problem under given orness level are equivalent. They both have the same equidifferent form, which composes a weighting vector of nonnegative arithmetic progression and zeros. This equidifferent OWA weighting vector generating method can also be seen as an improved solution method for the minimum variance and minimax dispersion problems respectively
© 2001-2024 Fundación Dialnet · Todos los derechos reservados