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.
Publisher
Cambridge University Press (CUP)
Reference5 articles.
1. Programming with linear fractional functionals
2. An algorithm for quadratic programming
3. A note on mathematical programming with fractional objective functions
4. Feasible direction approach to fractional programming problems;Sharma;Opsearch,1967
5. Programming with quadratic fractional functionals;Swarup;Opsearch,1965
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fractional Programming;Nonconvex Optimization and Its Applications;1995
2. Bibliography in fractional programming;Zeitschrift für Operations Research;1982-12
3. A Branch and Bound Method for Integer Nonlinear Fractional Programs;ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik;1980
4. Fractional and complex programming;Mathematical Programming and Control Theory;1978
5. On fractional programming and equivalence;Naval Research Logistics Quarterly;1975-06