论文信息 - Programming Problems with Convex Fractional Functions

Programming Problems with Convex Fractional Functions

The main result proved in this paper is that the ratio of the square of a nonnegative convex function to a strictly positive concave function is convex over a convex domain. Some particular cases of this result and a few applications to mathematical programming are also considered.

C. R. Bector

[1] Anthony V. Fiacco,et al. The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual Method , 1964 .

[2] J. B. Rosen. The gradient projection method for nonlinear programming: Part II , 1961 .

[3] B. Martos. The Direct Power of Adjacent Vertex Programming Methods , 1965 .

[4] E. M. L. Beale,et al. Nonlinear and Dynamic Programming , 1965 .

[5] J. B. Rosen. The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[6] Edmund Eisenberg,et al. A NOTE ON SEMIDEFINITE MATRICES , 1961 .

[7] K. Swarup. Letter to the Editor-Linear Fractional Functionals Programming , 1965 .

[8] Abraham Charnes,et al. Programming with linear fractional functionals , 1962 .