Abstract:
Based on LexiT ordering and LexiS ordering, whose maximum calculations are 2n, LexiTN ordering and LexiSN ordering are proposed in this paper, which preserve all the properties of LexiT ordering and LexiS ordering and whose maximum calculations are 2n-1. Based on two averaging aggregation operators, the generalized averaging operator and ordered weighted averaging operator, LexiH ordering and LexiF ordering are presented and their properties are studied. LexiR ordering on ［0,1］［n］ is generalized to ［0,1］n and their properties are discussed.
