The ways of placing decision making units (DMUs) in certain clusters are found as a subject in statistics, these ways usually are heuristic. The proposed clustering approach in this article considers preferences of DMUs. This study applies Data Envelopment Analysis (DEA) DMUs are clustered by solving multi-objective linear problem (MOLP) and by considering preferences of each DMU at production ...

This paper proposes an innovative procedure of finding efficient facility location–allocation (FLA) schemes, integrating data envelopment analysis (DEA) and a multi-objective programming (MOP) model methodology. FLA decisions provide a basic foundation for designing efficient supply chain network in many practical applications. The procedure proposed in this paper would be applied to the FLA pr...

Evaluation of human-computer spoken dialogues is often based on analyses of objective metrics such as task completion rate, turn-taking, time consumption, etc. While these data are easily obtained and processed from log files, they offer or very little information about the actual usability of the given service as perceived by the test subjects. This study combines the evaluation based on objec...

Automatic test data generation is a very popular domain in the field of search-based software engineering. Traditionally, the main goal has been to maximize coverage. However, other objectives can be defined, such as the oracle cost, which is the cost of executing the entire test suite and the cost of checking the system behavior. Indeed, in very large software systems, the cost spent to test t...

Data centres are facilities with large amount of machines (i.e., servers) and hosted processes (e.g., virtual machines). Managers of data centres (e.g., operators, capital allocators, CRM) constantly try to optimise them, reassigning ‘better’ machines to processes. These managers usually see better/good placements as a combination of distinct objectives, hence why in this paper we define the da...

In this paper we examine multi-objective linear programming problems in the face of data uncertainty both in the objective function and the constraints. First, we derive a formula for radius of robust feasibility guaranteeing constraint feasibility for all possible uncertainties within a specified uncertainty set under affine data parametrization. We then present a complete characterization of ...