Displaying similar documents to “On the learning of weights in some aggregation operators: the weigthed mean and OWA operators.”

Weighted sums of aggregation operators.

Tomasa Calvo, Bernard De Baets, Radko Mesiar (1999)

Mathware and Soft Computing

Similarity:

The aim of this work is to investigate when a weighted sum, or in other words, a linear combination, of two or more aggregation operators leads to a new aggregation operator. For weights belonging to the real unit interval, we obtain a convex combination and the answer is known to be always positive. However, we will show that also other weights can be used, depending upon the aggregation operators involved. A first set of suitable weights is obtained by a general method based on the...

Consistency-driven approximation of a pairwise comparison matrix

Esther Dopazo, Jacinto González-Pachón (2003)

Kybernetika

Similarity:

The pairwise comparison method is an interesting technique for building a global ranking from binary comparisons. In fact, some web search engines use this method to quantify the importance of a set of web sites. The purpose of this paper is to search a set of priority weights from the preference information contained in a general pairwise comparison matrix; i.e., a matrix without consistency and reciprocity properties. For this purpose, we consider an approximation methodology within...

Weighted composition operators on weighted Lorentz spaces

İlker Eryilmaz (2012)

Colloquium Mathematicae

Similarity:

The boundedness, compactness and closedness of the range of weighted composition operators acting on weighted Lorentz spaces L(p,q,wdμ) for 1 < p ≤ ∞, 1 ≤ q ≤ ∞ are characterized.

A model for opinion agreement and confidence in multi-expert multi-criteria decisión making.

Gerardo Canfora, Luigi Troiano (2004)

Mathware and Soft Computing

Similarity:

In multi-expert multi-criteria decision making problems, we often have to deal with different opinions, different importance of criteria and experts, missing data, unexpressed opinions and experts who are not fully confident with their judgment. All these factors make the problem more difficult to solve, and run the risk of making the model logic less transparent. In this paper, we present a model based on simple assumptions described by logical rules, in order to maintain the model...

Evaluation of decision-making units based on the weight-optimized DEA model

Jiasen Sun, Rui Yang, Xiang Ji, Jie Wu (2017)

Kybernetika

Similarity:

Data envelopment analysis (DEA) is a methodology for measuring best relative efficiencies of a group of peer decision-making units (DMUs) that take multiple inputs to produce multiple outputs. However, the traditional DEA model only aims to maximize the efficiency of the DMU under evaluation. This usually leads to very small weights (even zero weights) being assigned to some inputs or outputs. Correspondingly, these inputs or outputs have little or even no contribution to efficiency,...

Solving the Crop Allocation Problem using Hard and Soft Constraints

Mahuna Akplogan, Simon de Givry, Jean-Philippe Métivier, Gauthier Quesnel, Alexandre Joannon, Frédérick Garcia (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Application tools for the crop allocation problem (CAP) are required for agricultural advisors to design more efficient farming systems. Despite the extensive treatment of this issue by agronomists in the past, few methods tackle the crop allocation problem considering both the spatial and the temporal aspects of the CAP. In this paper, we precisely propose an original formulation addressing the crop allocation planning problem while taking farmers’ management choices into account. These...