Possibilistic optimization problems with mutually t-related parameters

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.