Abstract
The problem considered is that of maximizing the ratio of a concave function to a convex function subject to constraints in terms of upper bounds on convex functions and with each variable occurring in a single constraint. It is demonstrated that the Kuhn-Tucker conditions are sufficient for a feasible solution to be optimal.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. W. Kuhn and A. W. Tucker,Nonlinear programming, Proceedings of the second Berkeley Symposium on Mathematical Statistics and Probability, 481–490, University of California Press (1951).
K. M. Mjelde,Convex-concave fractional programming with each variable occurring in a single constraint, BIT 18 (1978), 202–210.
K. M. Mjelde,Allocation of resources according to a fractional objective, EJOR 2 (1978), 116–124.
M. Slater,Lagrange multiplier revisited: A contribution to non-linear programming, The Rand Corporation, Santa Monica, Cal. RM-676 (1951).
R. T. Rockafellar,Convex analysis, Princeton University Press, Princeton, N.J., (1972).
S. P. Bradley and S. C. Frey,Fractional programming with homogeneous functions, Opns. Res. 22 (1974), 350–357.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mjelde, K.M. Sufficiency of Kuhn-Tucker optimality conditions for a fractional programming problem. BIT 18, 454–456 (1978). https://doi.org/10.1007/BF01932024
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932024