Optimization Under Fuzzy Constraints: From a Heuristic Algorithm to an Algorithm that Always Converges

Abstract

An efficient iterative heuristic algorithm has been used to implement Bellman-Zadeh solution to the problem of optimization under fuzzy constraints. In this paper, we analyze this algorithm, explain why it works, show that there are cases when this algorithm does not converge, and propose a modification that always converges.