Duality theory for generalized fractional programmes (Q790050)

If \(K_ j\) and \(a_ j\), \(j=1,2,...,n\) denote, respectively, bounded polyhedral convex sets in \({\mathbb{R}}^ n\) and the columns of a matrix A with \(a_ j\) from \(K_ j\) then the generalized fractional program can write in the following form: \[ \min \frac{cx+\alpha}{dx+\beta},\quad subject\quad to\quad Ax=b,\quad x\geq 0, \] where \(Ax=b\) for some \(a_ j\in K_ j\), \(x\geq 0\). Considering this as the primal problem, then the dual problem has the form of an inexact linear program for which the duality theorem is true. The paper propose a computational method which is effective if the sets \(K_ j\), \(j=1,2,...,n\) are parallelepipeds.