k-minitive capacities and k-minitive aggregation functions

The main aim of this paper is to evoke more attentions on the dual concepts of k-maxitive capacity and k-maxitive aggregation, called k-minitive capacity and k-minitive aggregation by convention. We point out that possibility and necessity capacities, and k-tolerant and k-intolerant capacities are special cases of k-maxitive and k-minitive capacities. We also discuss some properties of k-minitive aggregation dual to those of the k-maxitive aggregation functions. For the purport of advocating the application of k-minitive and k-maxitive capacities, we finally present the mixed integer programming based identification method and illustrate its steps and results through an example.