Erişime Açık

Analysis of a Non-Discriminating Criterion in Simple Additive Weighting Deep Hierarchy

İbrahim Gürler | Bora Gündüzyeli | Ozan Çakır

In the current account, we present an analysis of a non-discriminating criterion under simple additive weighting synthesis, considering a deep decision hierarchy. A non-discriminating criterion describes a criterion where all decision alternatives under consideration perform equally. We question eliminating such a criterion from the decision hierarchy in search of simpler problem representation and computational efficiency. Yet, we prove such an approach may result in order misrepresentations between decision alternatives. This analysis is performed in the form of four research questions that ...Daha fazlası

Erişime Açık

Distance-Based Decision Making, Consensus Building, and Preference Aggregation Systems: A Note on the Scale Constraints

İbrahim Gürler | Bora Gündüzyeli | Ozan Çakır

Distance metrics and their extensions are widely accepted tools in supporting distancebased decision making, consensus building, and preference aggregation systems. For several models of this nature, it may be necessary to elucidate the problem output in the original input domain. When a particular parameter of interest is desired to be produced in this original domain, i.e., the scale, the decision makers simply resort to constraints that function in parallel with this goal. However, there exist some cases where such a membership is guaranteed by the mathematical properties of the distance ...Daha fazlası

Erişime Açık

Some Generalized Results on Grey Number Operations Based on Liu-Lin Axioms of Greyness Degree and Information Content

Ozan Çakır | İbrahim Gürler | Bora Gündüzyeli

In this manuscript, with grounding in Liu–Lin axioms of greyness degree and information content, we provide new results that relate to these concepts in consideration of a number of mathematical operations over a sequence of grey numbers. In particular, we derive greyness degree results of summation, conic combination, and convex combination of a sequence, as well as inverse of a number and normalization of a number over a sequence. Then, we turn our attention to prove information content results for the union and intersection of a sequence. We illustrate our results by using a simple Monte Ca ...Daha fazlası

6698 sayılı Kişisel Verilerin Korunması Kanunu kapsamında yükümlülüklerimiz ve çerez politikamız hakkında bilgi sahibi olmak için alttaki bağlantıyı kullanabilirsiniz.

Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.