Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T21:17:23.582Z Has data issue: false hasContentIssue false

A duality theorem for a nondifferentiable nonlinear fractional programming problem

Published online by Cambridge University Press:  17 April 2009

B. Mond
Affiliation:
Department of Pure Mathematics, La Trobe University, Bundoora, Victoria;
B.D. Craven
Affiliation:
Department of Mathematics, University of Melbourne, Parkville, victoria.
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.

A duality theorem, and a converse duality theorem, are proved for a nonlinear fractional program, where the numerator of the objective function involves a concave function, not necessarily differentiable, and also the support function of a convex set, and the denominator involves a convex function, and the support function of a convex set. Various known results are deduced as special cases.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1979