We propose a data envelopment analysis (DEA)-based approach to ranking multi-criteria alternatives. We call it "the area of the efficiency score graph" (AES) approach. Unlike the classical DEA score and Dk measure that counts the number of DMUs (alternatives in DEA terminology) that should be...

In this paper, we present an exact algorithm to find all extreme supported nondominated points of multiobjective mixed integer programs. The algorithm uses a composite linear objective function and finds all the desired points in a finite number of steps by changing the weights of the objective...

We propose an evolutionary metaheuristic for multiobjective combinatorial optimization problems that interacts with the decision maker (DM) to guide the search effort toward his or her preferred solutions. Solutions are presented to the DM, whose pairwise comparisons are then used to estimate...

We consider product and process design problems (hereafter collectively called process design problems) that address issues associated with the assessment of optimum levels for process inputs that influence multiple-process performance measures. While this problem context encompasses many...

Data Envelopment Analysis (DEA) is a methodology that computes efficiency values for decision making units (DMU) in a given period by comparing the outputs with the inputs. In many applications, inputs and outputs of DMUs are monitored over time. There might be a time lag between the consumption...

While raising debt on behalf of the government, public debt managers need to consider several possibly conflicting objectives and have to find an appropriate combination for government debt taking into account the uncertainty with regard to the future state of the economy. In this paper, we...

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...

We develop an interactive partitioning approach for solving the multiobjective decision making problem of a decision maker (DM) who has an implicit general monotone utility function. The approach reduces feasible solution space using the DM's preferences. Hypothetical solutions called partition...

No abstract received.