T authors propose two variants of lexicographic preference rules. They obtain the necessary and sufficient conditions under which a linear utility function represents a standard lexicographic rule, and each of the proposed variants, over a set of discrete attributes. They then: (i) characterize the measurement properties of the parameters in the representations; (ii) propose a nonmetric procedu...

cross efficiency is a method with the idea of peer evaluation instead of self-evaluation, and is used for evaluation and ranking decision making units (dmus) in data envelopment analysis (dea). unlike most existing dea ranking models which can only rank a subset of dmus, for example non-efficient or extreme efficient dmus, cross efficiency can rank all dmus, even non-extreme ones. however, sinc...

A very useful multi-objective technique is goal programming. There are many methodologies of goal programming such as weighted goal programming, min-max goal programming, and lexicographic goal programming. In this paper, weighted goal programming is reformulated as goal programming with logarithmic deviation variables. Here, a comparison of the proposed method and goal programming with weighte...

In this paper the lexicographic decision process is presented in a unified way. We construct a lexicographic decision function using a universal preference function and a unary function. This construction incorporates the different outranking approaches,the lexicographic decision process and the utility based decision making models. Finally we consider the connection of the lexicographic decisi...

A modification of the standard lexicographic method, used for linear multiobjective optimization problems, is presented. An algorithm for solving these kind of problems is developed, for the cases of two and three unknowns. The algorithm uses the general idea of indicating the lexicographic order to objective functions, combined with the graphical method of linear programming. Implementation de...

Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variables. The polyranking principle is proposed as a generalization of polynomial ranking for analyzing termination of loops. We define lexicographic polyranking functions in the context of loops with parallel transitions ...