Chance constrained spanning tree problems using possibility and necessity measures

摘要

In this research, we consider a spanning tree problem where each edge cost is represented with a fuzzy random variable. We formulate the problem as a chance constrained programming problem with respect to a possibility measure or a necessity measure. In order to solve the problem, we transform it into the deterministic equivalent problem and provide a polynomial order algorithm.