Feasibility Analysis for Fuzzy/Crisp Linear Programming Problems

In this paper we analyze feasibility conditions for Fuzzy Linear Programming problems (FLP) and a special case where its constraints are composed by fuzzy numbers bounded by crisp numbers. We analyze three cases: strong, weak feasibility, and unfeasible FLPs, where strong feasibility is much more desirable than weak one since it generalizes feasible solutions.