A flexible approach to ranking with an application to MBA Programs

Date

2010-03-01

Author

Köksalan, Mustafa Murat
Buyukbasaran, Tayyar
Ozpeynirci, Oezguer
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

239
views

0
downloads

We develop a model for flexibly ranking multi-dimensional alternatives/units into preference classes via Mixed Integer Programming. We consider a linear aggregation model, but allow the criterion weights to vary within pre-specified ranges. This allows the individual alternatives/units to play to their strengths. We illustrate the use of the model by considering the Financial Times Global MBA Program rankings and discuss the implications. We argue that in many applications neither the data nor the weights or the aggregation model itself is precise enough to warrant a complete ranking, providing an argument for sorting or what we call flexible ranking.

Subject Keywords

Management Science and Operations Research, Modelling and Simulation, Information Systems and Management

URI

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

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

DOI

https://doi.org/10.1016/j.ejor.2009.02.034

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An efficient algorithm for the capacitated single item dynamic lot size problem Kırca, Ö. (Elsevier BV, 1990-3) A dynamic programming based algorithm is developed for the single item lot size problem with concave costs and arbitrary capacities. By making use of the extreme point properties of the problem, first the set of all feasible cumulative production levels that may occur in an optimal solution is generated. In the second stage, a dynamic programming procedure is carried out over this set. The worst case computational effort is equal to that of the standard dynamic programming approach but extensive computation...
A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09) In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...
Multi-objective integer programming: A general approach for generating all non-dominated solutions Oezlen, Melih; Azizoğlu, Meral (Elsevier BV, 2009-11-16) In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical epsilon-constraint method. Objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical epsilon-constraint method on the bi-objective integer programming problem for the sake of comple...
A New Outranking-Based Approach for Assigning Alternatives to Ordered Classes Köksalan, Mustafa Murat; Mousseau, Vincent; Ozpeynirci, Oezguer; Ozpeynirci, Selin Bilgin (Wiley, 2009-02-01) We consider the problem of assigning alternatives evaluated on several criteria into ordered categories C(1), C(2), ..., C(p). This problem is known as the multi-criteria sorting problem and arises in many situations such as classifying countries into different risk levels based on economical and socio-political criteria, evaluating credit applications of bank customers. We are interested in sorting methods that are grounded on the construction Of Outranking relations. Among these, the Electre Tri method re...
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 ...

Citation Formats

M. M. Köksalan, T. Buyukbasaran, O. Ozpeynirci, and J. Wallenius, “A flexible approach to ranking with an application to MBA Programs,” EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, pp. 470–476, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52091.