The general least square deviation OWA operator problem

5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

A crucial issue in applying the ordered weighted averaging (OWA) operator for decision making is the determination of the associated weights. This paper proposes a general least convex deviation model for OWA operators which attempts to obtain the desired OWA weight vector under a given orness level to minimize the least convex deviation after monotone convex function transformation of absolute deviation. The model includes the least square deviation (LSD) OWA operators model suggested by Wang, Luo and Liu in Computers & Industrial Engineering, 2007, as a special class. We completely prove this constrained optimization problem analytically. Using this result, we also give solution of LSD model suggested by Wang, Luo and Liu as a function of n and a completely. We reconsider two numerical examples that Wang, Luo and Liu, 2007 and Sang and Liu, Fuzzy Sets and Systems, 2014, showed and consider another different type of the model to illustrate our results.

Cite

CITATION STYLE

APA

Hong, D. H., & Han, S. (2019). The general least square deviation OWA operator problem. Mathematics, 7(4). https://doi.org/10.3390/math7040326

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free