Duality in generalized linear fractional programming

Abstract

We consider a generalization of a linear fractional program where the maximum of finitely many linear ratios is to be minimized subject to linear constraints. For this Min-Max problem, a dual in the form of a Max-Min problem is introduced and duality relations are established. © 1983 The Mathematical Programming Society, Inc.