Convex cone-based partial order for multiple criteria alternatives

Date

2011-05-01

Author

Dehnokhalaji, Akram
Korhonen, Pekka J.
Köksalan, Mustafa Murat
Nasrabadi, Nasim
Wallenius, Jyrki

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

71
views

0
downloads

In this paper, we consider the problem of finding a preference-based strict partial order for a finite set of multiple criteria alternatives. We develop an approach based on information provided by the decision maker in the form of pairwise comparisons. We assume that the decision maker's value function is not explicitly known, but it has a quasi-concave form. Based on this assumption, we construct convex cones providing additional preference information to partially order the set of alternatives. We also extend the information obtained from the quasi-concavity of the value function to derive heuristic information that enriches the strict partial order. This approach can as such be used to partially rank multiple criteria alternatives and as a supplementary method to incorporate preference information in, e.g. Data Envelopment Analysis and Evolutionary Multi-Objective Optimization.

Subject Keywords

Arts and Humanities (miscellaneous), Information Systems and Management, Management Information Systems, Developmental and Educational Psychology, Information Systems

URI

https://hdl.handle.net/11511/57859

Journal

DECISION SUPPORT SYSTEMS

DOI

https://doi.org/10.1016/j.dss.2010.11.019

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

A visual interactive approach for multiple criteria decision making with monotone utility functions Köksalan, Mustafa Murat; Rizi, O (Informa UK Limited, 2001-06-01) We consider the problem of choosing the best of a set of alternatives where each alternative is evaluated on multiple criteria. We develop a visual interactive approach assuming that the decision maker (DM) has a general monotone utility function. The approach partitions the criteria space into nonoverlapping cells. The DM uses various graphical aids to move between cells and to further manipulate selected cells with the goal of creating cells that have ideal points less preferred than an alternative. When ...
Cyclic codes and reducible additive equations Guneri, Cem; Özbudak, Ferruh (Institute of Electrical and Electronics Engineers (IEEE), 2007-02-01) We prove a Weil-Serre type bound on the number of solutions of a class of reducible additive equations over finite fields. Using the trace representation of cyclic codes, this enables us to write a general estimate for the weights of cyclic codes. We extend Woffmann's weight bound to a larger classes of cyclic codes. In particular, our result is applicable to any cyclic code over F-p and F-p2, where p is an arbitrary prime. Examples indicate that our bound performs very well against the Bose-Chaudhuri-Hocqu...
A discrete optimality system for an optimal harvesting problem Bakan, Hacer Oz; Yilmaz, Fikriye; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2017-10-01) In this paper, we obtain the discrete optimality system of an optimal harvesting problem. While maximizing a combination of the total expected utility of the consumption and of the terminal size of a population, as a dynamic constraint, we assume that the density of the population is modeled by a stochastic quasi-linear heat equation. Finite-difference and symplectic partitioned Runge-Kutta (SPRK) schemes are used for space and time discretizations, respectively. It is the first time that a SPRK scheme is e...
Comparison of feature-based and image registration-based retrieval of image data using multidimensional data access methods Arslan, Serdar; Yazıcı, Adnan; Sacan, Ahmet; Toroslu, İsmail Hakkı; Acar, Esra (Elsevier BV, 2013-07-01) In information retrieval, efficient similarity search in multimedia collections is a critical task In this paper, we present a rigorous comparison of three different approaches to the image retrieval problem, including cluster-based indexing, distance-based indexing, and multidimensional scaling methods. The time and accuracy trade-offs for each of these methods are demonstrated on three different image data sets. Similarity of images is obtained either by a feature-based similarity measure using four MPEG-...
Constructing linear unequal error protection codes from algebraic curves Özbudak, Ferruh (Institute of Electrical and Electronics Engineers (IEEE), 2003-06-01) We show that the concept of "generalized algebraic geometry codes" which was recently introduced by Xing, Niederreiter, and Lam gives a natural framework for constructing linear unequal error protection codes.

Citation Formats

A. Dehnokhalaji, P. J. Korhonen, M. M. Köksalan, N. Nasrabadi, and J. Wallenius, “Convex cone-based partial order for multiple criteria alternatives,” DECISION SUPPORT SYSTEMS, pp. 256–261, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57859.