Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-29T08:10:30.150Z Has data issue: false hasContentIssue false
  • English
  • Français

Nonlinear fractional programming

Published online by Cambridge University Press:  17 April 2009

B. Mond  and
B.D. Craven
B. Mond
Affiliation:
Department of 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.

If an optimal solution exists for a nonlinear fractional programming problem, then this solution is shown to be obtainable by solving two associated programming problems whose objective functions are no longer fractional. A certain restriction is assumed on the constraint sets of the latter problems. This result includes various known theorems as special cases.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 12 , Issue 3 , June 1975 , pp. 391 - 397
Copyright
Copyright © Australian Mathematical Society 1975

References

[1]Charnes, A. and Cooper, W.W., “Programming with linear fractional functionals”, Nav. Res. Log. Quart. 9 (1962), 181–186.Google Scholar
[2]Frank, Marguerite and Wolfe, Philip, “An algorithm for quadratic programming”, Nαv. Res. Log. Quart. 3 (1956), 95–110.CrossRefGoogle Scholar
[3]Mond, B. and Craven, B.D., “A note on mathematical programming with fractional objective functions”, Nαv. Res. Log. Quart. 20 (1973), 577–581.CrossRefGoogle Scholar
[4]Sharma, I.C., “Feasible direction approach to fractional programming problems”, Opsearch 4 (1967), 61–72.Google Scholar
[5]Swarup, Kanti, “Programming with quadratic fractional functionals”, Opsearch 2 (1965), 23–30.Google Scholar