.png){kind=icon}
Return
Constrained OWA aggregation
.png){kind=icon}
PRE
AI
DOI：10.1016/0165-0114(95)00242-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The ordered weighted averaging operators are introduced and some of their properties described. Attention is then focused on the problem of maximizing an OWA aggregation of a group of variables that are interrelated and constrained by a collection of linear inequalities. It is shown how this problem can be modeled as an integer linear programming problem. An evaluation procedure for linguistically quantified propositions using OWA operators is described. Use is made of this procedure to provide a solution to fuzzy linear programming problems in which some linguistically proscribed number of the goals must be satisfied.
Keywords:
fuzzy mathematical programming
linguistic quantifiers
constrained optimization
OWA operators
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
7.6K
Citations:
1.5W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSave no more
no more