Show simple item record

dc.contributor.advisorKarsu, Özlem
dc.contributor.authorDenktaş, Tuğba
dc.date.accessioned2021-05-26T10:53:50Z
dc.date.available2021-05-26T10:53:50Z
dc.date.copyright2021-05
dc.date.issued2021-05
dc.date.submitted2021-05-24
dc.identifier.urihttp://hdl.handle.net/11693/76359
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (M.S.): Bilkent University, Department of Industrial Engineering, İhsan Doğramacı Bilkent University, 2021.en_US
dc.descriptionIncludes bibliographical references (leaves 60-65).en_US
dc.description.abstractWe propose interactive algorithms to find the most preferred solution of biobjec-tive and triobjective integer programming problems. The algorithms can be used in any setting where the decision-maker has a general monotone utility function. They divide the image space of the problems into boxes and search them by solv-ing Pascoletti-Serafini scalarizations, asking questions to the decision-maker so as to eliminate boxes whenever possible. We also propose a cone based approach that can be incorporated into both algorithms if the decision-maker is assumed to have a non-decreasing quasiconcave utility function. We demonstrate the performances of the algorithms and their cone based extensions with computational experiments. The results of the experiments show that interactive algorithms are very useful in terms of solution time compared to a posteriori algorithms that find the whole Pareto set. The results of the experiments also show that the cone based approach leads to less interaction with the decision-maker.en_US
dc.description.statementofresponsibilityby Tuğba Denktaşen_US
dc.format.extentx, 65 leaves : illustrations ; 30 cm.en_US
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectMultiobjective integer programmingen_US
dc.subjectInteractive algorithmsen_US
dc.subjectConvex conesen_US
dc.titleInteractive algorithms to solve biobjective and triobjective decision making problemsen_US
dc.title.alternativeİki amaçlı ve üç amaçlı karar verme problemleri için algoritmalaren_US
dc.typeThesisen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.publisherBilkent Universityen_US
dc.description.degreeM.S.en_US
dc.identifier.itemidB126165


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record