α-cut Based Possibilistic Programming

This paper proposes a method to solve possibilistic linear programming problems with triangular fuzzy parameters. The method relies on α-cuts of objective and constraints to generate a classical linear programming problem. In this paper, after eliciting the α-cuts, the resulted intervals are substituted by bounded variables. Then, a nonlinear programming problem is achieved which, is reduced to a linear programming problem by suitable substitutions. A numerical example has been worked out to highlight the proposed method.

کلیدواژه ها:

Possibilistic Programming ، Triangular Fuzzy Number ، α-cut