Article contents
A duality theorem for a nondifferentiable nonlinear fractional programming problem
Published online by Cambridge University Press: 17 April 2009
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1979
References
- 5
- Cited by