Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Identifying and ranking a most preferred subset of alternatives in the presence of multiple criteria
Date
1989-8
Author
Köksalan, M. Murat
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
125
views
0
downloads
Cite This
Subject Keywords
Management science and operations research
,
General engineering
,
Modelling and simulation
,
Ocean engineering
URI
https://hdl.handle.net/11511/52071
Journal
Naval Research Logistics
DOI
https://doi.org/10.1002/1520-6750(198908)36:4<359::aid-nav3220360402>3.0.co;2-9
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
An approach for solving discrete alternative multiple criteria problems involving ordinal criteria
Köksalan, Murat; Karwan, Mark H.; Zionts, Stanley (Wiley, 1988-12)
The existence of ordinal criteria is a factor that complicates multiple criteria problems. In this article we develop an approach for the problem of choosing among discrete alternatives assuming that criteria are ordinal. The approach requires pairwise comparisons of alternatives by the decision maker. Based on these comparisons, presumably inferior alternatives are eliminated. Experience on randomly generated problems indicates that the approach usually chooses one of the most preferred alternatives and re...
Constructing a strict total order for alternatives characterized by multiple criteria: An extension
Dehnokhalaji, Akram; Korhonen, Pekka J.; Köksalan, Mustafa Murat; Nasrabadi, Nasim; Ozturk, Diclehan Tezcaner; Wallenius, Jyrki (Wiley, 2014-03-01)
The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model ...
Collaborative procurement among competing buyers
Keskinocak, Pinar; Savaşaneril Tüfekci, Seçil (Wiley, 2008-09-01)
Collaborative procurement emerged as one of the many initiatives for achieving improved inter-firm coordination and collaboration. In this article, we adopt a game-theoretical approach to study the interaction between two firms who procure jointly, but produce independently and remain competitors in a product market characterized by price-sensitive demand. We study the underlying economics behind collaborative procurement, examine the effects of collaboration on buyer and supplier profitability, and derive ...
An interactive procedure for selecting acceptable alternatives in the presence of multiple criteria
Ulu, C; Köksalan, Mustafa Murat (Wiley, 2001-10-01)
In this paper, we consider the multiple criteria decision-making problem of partitioning alternatives into acceptable and unacceptable sets. We develop interactive procedures for the cases when the underlying utility function of the decision maker is linear, quasiconcave, and general monotone. We present an application of the procedures to the problem of admitting students to the master's degree program at the Industrial Engineering Department, Middle East Technical University. (C) 2001 John Wiley & Sons, Inc.
A heuristic approach to bicriteria scheduling
Köksalan, Mustafa Murat (Wiley, 1999-10-01)
We consider the problem of sequencing jobs on a single machine while minimizing a nondecreasing function of two criteria. We develop a heuristic procedure that quickly finds a good solution for bicriteria scheduling. The procedure is based on using several arcs in the criterion space that are representative of the possible locations of nondominated solutions. By sampling a small number of points on these arcs, a promising point is identified in the criterion space for each are. An efficient sequence in the ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. M. Köksalan, “Identifying and ranking a most preferred subset of alternatives in the presence of multiple criteria,”
Naval Research Logistics
, pp. 359–372, 1989, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52071.