L-fuzzifying antimatroids: A fuzzy approach to the generalization of shelling precedence structures.

Crisp antimatroid is a combinatorial abstraction of convexity. It also can be incorporated into the greedy algorithm in order to seek the optimal solutions. Nevertheless, this kind of significant classical structure has inherent limitations in addressing fuzzy optimization problems and abstracting fuzzy convexities. This paper introduces the concept of L-fuzzifying antimatroid associated with an L-fuzzifying family of feasible sets. Several relevant fundamental properties are obtained. We also propose the concept of L-fuzzifying rank functions for L-fuzzifying antimatroids, and then investigate their axiomatic characterizations. Finally, we shed light upon the bijective correspondence between an L-fuzzifying antimatroid and its L-fuzzifying rank function. [ABSTRACT FROM AUTHOR]