J Austral Math Soc Ser A 58 pp376--386, 1995.

Duality in Fractional Minimax Programming

S. Chandra and Viveka Kumar

(Received 27 March 1992; revised 7 September 1992)

Abstract

Certain omissions in the recently introduced dual for fractional minimax programming problem 'minimise max_{y Î
Y} f(x, y) / h(x, y), subject to g(x) Ł 0', are indicated and two modified duals for this problem are presented. Various fractional programming and generalized fractional programming duals are shown to be special cases of this study.

1991 AMS Subject Classification: 90C32

Browse the article

Read the article in your browser. (Scale your print to fit your paper).

Authors

S. Chandra
Viveka Kumar: Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi- 110016, India.

Editor JAMSB(E): editor at anziamj.austms.org.au
WWW Administrator: webmaster at anziamj.austms.org.au

Last Modified: Thu Jan 9 9:04:22 2003