Sensitivity analysis in piecewise linear fractional programming problem with non-degenerate optimal solution

Abstract

In this paper, we study how changes in the coefficients of objective function and the right-hand-side vector of constraints of the piecewise linear fractional programming problems affect the non-degenerate optimal solution. We consider separate cases when changes occur in different parts of the problem and derive bounds for each perturbation, while the optimal solution is invariant. We explain that this analysis is a generalization of the sensitivity analysis for $LP$, $LFP$ and $PLP$. Finally, the results are described by some numerical examples.