Abstract
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. © 1975, Australian Mathematical Society. All rights reserved.
Cite
CITATION STYLE
APA
Mond, B., & Craven, B. D. (1975). Nonlinear fractional programming. Bulletin of the Australian Mathematical Society, 12(3), 391–397. https://doi.org/10.1017/S0004972700024047
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free