The problem of existence and uniqueness of greatest lower bound (glb) and least upper bound (lub) of a set in group induced cone (GIC) ordering is discussed. Explicit formula for the glb is given. The results are applied to obtain the best possible upper bound in GIC ordering for values of linear an
G-Majorization, group-induced cone orderings, and reflection groups
β Scribed by A.G.M. Steerneman
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 741 KB
- Volume
- 127
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## An analytical characterization of effective and of irreducible groups inducing cone orderings is given. The characterization implies easily a necessary condition for a group majorization to be a group induced cone ordering.
extended the idea of order-induced aggregation to the Choquet aggregation and defined a more general type of Choquet integral operator called the induced Choquet ordered averaging (I-COA) operator, which take as their argument pairs, in which one component called order-inducing variable is used to i
In this short communication, we will show that the condition of the theorem does not hold in general cases in a recent paper ''The induced continuous ordered weighted geometric operators and their application in group decision making" [Computers & Industrial Engineering 56 (2009) 1545-1552] by Wu et