This paper investigates a possibilistic optimization problem where the parameters are mutually t-related (interactive). An indirect solution based on the construction of an equivalent crisp analogue is proposed. A genetic algorithm method is used to solve this crisp equivalent. Illustrative numerical examples are included.
Rapid growth of the Internet informational resources has laid to the situation when classical search algorithms based on a template matching are no longer effective due to their practically boundless result sets. One of the possible solutions is using style classification which allows to effectively narrow search range. This work gives some guidelines for… (More)