Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T04:46:27.073Z Has data issue: false hasContentIssue false

Duality in fractional minimax programming

Published online by Cambridge University Press:  09 April 2009

S. Chandra
Affiliation:
Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi-110016, India
Viveka Kumar
Affiliation:
Department of Mathematics, Indian Institute of Technology, Hauz Khas, New Delhi-110016, India
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Certain omissions in the recently introduced dual for fractional minimax programming problem ‘minimize 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.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1995