Add to ORKGAbstract. 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 program-ming 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
Sensitivity analysis is used to quantify the impact of changes in the initial data of linear program...
Abstract. We consider the interior-point approach to sensitivity analysis in linear programming deve...
Abstract. In this paper, we have proposed an inverse model for linear fractional programming (LFP) p...
Abstract. In this paper, we study how changes in the coefficients of objective function and the righ...
In this paper, we study how changes in the coefficients of objective function and the right-hand-sid...
In this paper, we discuss how changes in the coefficients matrix of piecewise linear fractional prog...
In this paper, we discuss how changes in the coefficients matrix of piecewise linear fractional prog...
In this paper, we study the classical sensitivity analysis when the right- hand – side vector, and t...
In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and ...
Sensitivity analysis in linear programming studies the stability of optimal solutions and the optima...
In this paper, we consider algorithms, duality and sensitivity analysis for optimization problems, c...
In this paper an iterative method for solving linear fraction programming (LFP) problem is proposed,...
summary:In this note we consider a linear-fractional programming problem with equality linear constr...
This paper analyzes the effect on the optimal value of a given linear semi-infinite programming prob...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
Sensitivity analysis is used to quantify the impact of changes in the initial data of linear program...
Abstract. We consider the interior-point approach to sensitivity analysis in linear programming deve...
Abstract. In this paper, we have proposed an inverse model for linear fractional programming (LFP) p...
Abstract. In this paper, we study how changes in the coefficients of objective function and the righ...
In this paper, we study how changes in the coefficients of objective function and the right-hand-sid...
In this paper, we discuss how changes in the coefficients matrix of piecewise linear fractional prog...
In this paper, we discuss how changes in the coefficients matrix of piecewise linear fractional prog...
In this paper, we study the classical sensitivity analysis when the right- hand – side vector, and t...
In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and ...
Sensitivity analysis in linear programming studies the stability of optimal solutions and the optima...
In this paper, we consider algorithms, duality and sensitivity analysis for optimization problems, c...
In this paper an iterative method for solving linear fraction programming (LFP) problem is proposed,...
summary:In this note we consider a linear-fractional programming problem with equality linear constr...
This paper analyzes the effect on the optimal value of a given linear semi-infinite programming prob...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
Sensitivity analysis is used to quantify the impact of changes in the initial data of linear program...
Abstract. We consider the interior-point approach to sensitivity analysis in linear programming deve...
Abstract. In this paper, we have proposed an inverse model for linear fractional programming (LFP) p...