This article examines the construction of aggregation functions from data by minimizing the least absolute deviation criterion. We formulate various instances of such problems as linear programming problems. We consider the cases in which the data are provided as intervals, and the outputs ordering needs to be preserved, and show that linear programming formulation is valid for such cases. This feature is very valuable in practice, since the standard simplex method can be used.
Field of Research
080108 Neural, Evolutionary and Fuzzy Computation
Socio Economic Objective
970108 Expanding Knowledge in the Information and Computing Sciences