Journal of the Korean Institute of Intelligent Systems (한국지능시스템학회논문지)

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지
DOI QR코드

DOI QR Code

A remark to a Constrained OWA Aggregation

  • Hong Dug Hun (Department of Mathematics, Myongji University) ;
  • Kim Kyung Tae (Department of Electronics and Electrical Information Engineering, Kyungwon University)
  • Published : 2005.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

The problem of maximizing an OWA aggregation of a group of variables that are interrelated and constrained by a collection of linear inequalities is considered by Yager[Fuzzy Sets and Systems, 81(1996) 89-101]. He obtained how this problem can be modelled as a mixed integer linear programming problem. Recently, Carlsson et al. [Fuzzy Sets and Systems, 139(2003) 543-546] obtained a simple algorithm for exact computation of optimal solutions to a constrained OWA aggregation problem with a single constraint on the sum of all decision variables. In this note, we introduce anew approach to the same problem as Carlsson et al. considered. Indeed, it is a direct consequence of a known result of the linear programming problem.

Keywords

References

  1. C. Carlsson, R. Fuller, P. Majlender, "A Note on constrained OWA aggregation," Fuzzy Sets and Systems Vol.139, pp.543-546, 2003. https://doi.org/10.1016/S0165-0114(03)00185-4
  2. A. W. Robert, D. E. Varberg, "Convex functions", Academic Press, INC. London LTD, 1973.
  3. R. R. Yager, "Constrained OWA aggregation", Fuzzy Sets and Systems, Vol 81, pp. 89-101,1996. https://doi.org/10.1016/0165-0114(95)00242-1