J Austral Math Soc Ser B 31 pp484--492, 1990.

Duality for fractional minimax programming problems

Shri Ram Yadav and R. N. Mukherjee

(Received 2 November 1987; revised 12 January 1989)

Abstract

Duality theory is discussed for fractional minimax programming problems. Two dual problems are proposed for the minimax fractional problem: minimize max_yÎY f(x, y)/h(x, y), subject to g(x) £ 0. For each dual problem a duality theorm is established. Mainly these are generalisations of the results of Tanimoto [14] for minimax fractional programming problems. It is noteworthy here that these problems are intimately related to a class of nondifferentiable fractional programming problems.

Browse the article

Read the article in your browser. (Print at 75% on A4 paper).

Authors

Shri Ram Yadav
R. N. Mukherjee: Department of Applied Mathematics, Institute of Technology, Banaras Hindu University, Varanasi-221 005, India.

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

Last Modified: Mon Jan 14 16:50:22 2002