POSSIBLE AND NECESSARY OPTIMALITY TESTS IN POSSIBILISTIC LINEAR-PROGRAMMING PROBLEMS

In this paper, two kinds of optimality concepts are introduced into fu zzy linear programming problems in order to discuss the rationality of an obtained solution. One is possible optimality evaluating the possi bility degree to which the solution is optimal. The other, the dual co ncept, is necessary optimality evaluating the necessity degree to whic h the solution is optimal. When possibility distributions are defined by closed intervals, degrees of possible and necessary optimalities be come binary. Necessary and sufficient conditions for possible and nece ssary optimalities are induced in this case. Extending the results, me thods of calculating the degrees of possible and necessary optimalitie s are proposed. Some numerical examples are given to demonstrate the p roposed methods.