Extensions of the PROMETHEE method to deal with segmentation constraints application in a students' selection problem

Mavrotas, G; Rozakis, S

dc.contributor.author	Mavrotas, G	en
dc.contributor.author	Rozakis, S	en
dc.date.accessioned	2014-03-01T01:58:41Z
dc.date.available	2014-03-01T01:58:41Z
dc.date.issued	2009	en
dc.identifier.issn	12460125	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/28703
dc.subject	Multicriteria	en
dc.subject	Multiobjective programming	en
dc.subject	PROMETHEE	en
dc.subject	Student selection	en
dc.subject.other	Decision process	en
dc.subject.other	Group Decision Making	en
dc.subject.other	Integer programming problems	en
dc.subject.other	Multi-criteria	en
dc.subject.other	Multi-criteria method	en
dc.subject.other	Multiobjective programming	en
dc.subject.other	Pareto optimal solutions	en
dc.subject.other	Postgraduate programs	en
dc.subject.other	PROMETHEE	en
dc.subject.other	Promethee method	en
dc.subject.other	Selection problems	en
dc.subject.other	Decision making	en
dc.subject.other	Multiobjective optimization	en
dc.subject.other	Students	en
dc.subject.other	Integer programming	en
dc.title	Extensions of the PROMETHEE method to deal with segmentation constraints application in a students' selection problem	en
heal.type	journalArticle	en
heal.identifier.primary	10.3166/jds.18.203-229	en
heal.identifier.secondary	http://dx.doi.org/10.3166/jds.18.203-229	en
heal.publicationDate	2009	en
heal.abstract	The aim of the present paper is to propose a novel version of the well known multicriteria method PROMETHEE that deals with segmentation constraints and is also suitable for group decision making. The motivation for the development of the method was a real case study concerning the selection of students for a postgraduate program. The proposed method, named PROMETHEE V2, is based on the principles of PROMETHEE V but uses the results of PROMETHEE I (instead of PROMETHEE II) and exploits the information provided by the leaving and entering flows in order to formulate a bi-objective Integer Programming problem. The solution of the latter produces the Pareto optimal solutions which are usually more than one. Due to its structure, the whole decision process is especially suitable for group decision making. © 2009 Lavoisier, Paris.	en
heal.journalName	Journal of Decision Systems	en
dc.identifier.doi	10.3166/jds.18.203-229	en
dc.identifier.volume	18	en
dc.identifier.issue	2	en
dc.identifier.spage	203	en
dc.identifier.epage	229	en