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
Interactive Algorithms for Finding Preferred Solutions under Weighted Tchebycheff Preference Functions
Download
IFORS_2021_Programme_Book_Aug20.pdf
Date
2021-08-23
Author
Karakaya, Gülşah
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
264
views
1145
downloads
Cite This
URI
https://hdl.handle.net/11511/91934
https://www.ifors2021.kr/file/IFORS_2021_Programme_Book_Aug20.pdf
Conference Name
22nd Conference of the International Federation of Operational Research Societies (IFORS 2021)
Collections
Department of Business Administration, Conference / Seminar
Suggestions
OpenMETU
Core
Interactive algorithms for a wide variety of preference functions
Karakaya, Gülşah; Ahipaşaoğlu, Selin Damla (2016-11-16)
The advances in the technological infrastructure and in the Internet led electronic auctions to become popular. With online sites, people buy/sell inexpensive products/services through auctions. In this paper, we develop an interactive approach that provides aid to both the buyer and the bidders in a bi-attribute, multi-item auction environment. Our approach is applicable for both reverse and forward auctions. We test our approach for underlying linear preference functions of the buyer. We also adapt it as ...
Interactive algorithms for a broad underlying family of preference functions
Karakaya, Gülşah; AHİPAŞAOĞLU, Selin Damla (Elsevier BV, 2018-02-16)
In multi-criteria decision making approaches it is typical to consider an underlying preference function that is assumed to represent the decision maker's preferences. In this paper we introduce a broad family of preference functions that can represent a wide variety of preference structures. We develop the necessary theory and interactive algorithms for both the general family of the preference functions and for its special cases. The algorithms guarantee to find the most preferred solution (point) of the ...
Interactive solution procedure for full potential and boundary layer equations
Hacıoğlu, Abdurrahman; Alemdaroğlu, H. Nafiz; Department of Aeronautical Engineering (1997)
Interactive approaches for biobjective problems with progressively changing solution sets
Karakaya, Gülşah (Wiley, 2021-01-01)
In this study, we develop interactive approaches to find a satisfactory alternative of a decision maker (DM) having a quasiconvex preference function where the alternative set changes progressively. In this environment, we keep searching the available set of alternatives and estimating the preference function of the DM. As new alternatives emerge, we make better use of the available preference information and eventually converge to a preferred alternative of the DM. We test our approaches on biobjective, mu...
Interactive Approaches to Multiple Criteria Sorting Problems: Entropy-Based Question Selection Methods
Özarslan, Ali; Karakaya, Gülşah (2022-08-01)
In this study, interactive approaches for sorting alternatives evaluated on multiple criteria are developed. The possible category ranges of alternatives are defined by mathematical models iteratively under the assumption that the preferences of the decision maker (DM) are consistent with an additive utility function. Simulation-based and model-based parameter generation methods are proposed to hypothetically assign the alternatives to categories. A practical approach to solve the incompatibility problem of...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
G. Karakaya, “Interactive Algorithms for Finding Preferred Solutions under Weighted Tchebycheff Preference Functions,” presented at the 22nd Conference of the International Federation of Operational Research Societies (IFORS 2021), Seoul, Güney Kore, 2021, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/91934.