Nonlinear fractional programming
B. Mond, B. D. Craven
Abstract
Open-access reader
B. Mond, B. D. Craven
Abstract
Open-access reader
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.
OpenAlex reports 35 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Fractional programming, Mathematics, Nonlinear programming, Nonlinear system, Mathematical optimization, Constraint programming, Constraint (computer-aided design), Fractional calculus