Abstract
Data in many real-life engineering and economical problems suffer from inexactness. Herein we assume that we are given some intervals in which the data can simultaneously and independently perturb.
We consider a generalized linear fractional programming problem with interval data and present an efficient method for computing the range of optimal values. The method reduces the problem to solving from two to four real-valued generalized linear fractional programs, which can be computed in polynomial time using an appropriate interior point method solver.
We consider also the inverse problem: How much can data of a real generalized linear fractional program vary such that the optimal values do not exceed some prescribed bounds. We propose a method for calculating (often the largest possible) ranges of admissible variations; it needs to solve only two real-valued generalized linear fractional programs.
We illustrate the approach on a simple von Neumann economic growth model.