Robust optimality analysis of non-degenerate basic feasible solutions in linear programming problems with fuzzy objective coefficients

Abstract The necessarily optimal solution is known as the most reasonable to linear programming problems with interval/fuzzy objective function coefficients. As it remains against certain fluctuations of coefficients, can be seen a robust solution. In this paper, we demonstrate that necessary optimality degree non-degenerate basic feasible obtained easily by utilizing tolerance approach. evaluates what extent Several types fuzzy subsets showing possible range coefficient vector are considered. For each type subset, an efficient calculation method proposed. Numerical examples given illustrate proposed methods.