On crisp equivalents of fuzzy chance-constrained multilevel programming

As an extension of multilevel programming, fuzzy multilevel programming was proposed for dealing with decentralized decision-making problem with fuzzy parameters and it is more difficult for us to solve fuzzy multilevel programming for the Stackelberg-Nash equilibrium. In this paper, based on the credibility theory, some fuzzy chance-constrained multilevel programming models are converted to their crisp equivalents that can be solved by the traditional solution processes, thus providing an effective way for solving fuzzy multilevel programming for the Stackelberg-Nash equilibrium.