论文信息 - A new look at fractional programming

A new look at fractional programming

The parametric approach to fractional programming problems is examined and a new format is proposed for it. The latter reflects the fact that the approach as a whole capitalizes on a first-order necessary and sufficient optimality condition pertaining to differentiable pseudolinear functions.

M. Sniedovich

[1] M. I. Henig. The shortest path problem with two objective functions , 1986 .

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

[3] Kenneth O. Kortanek,et al. Pseudo-Concave Programming and Lagrange Regularity , 1967, Oper. Res..

[4] Werner Dinkelbach. On Nonlinear Fractional Programming , 1967 .

[5] J. Ponstein,et al. Seven kinds of convexity , 1967 .

[6] R. Jagannathan. On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming , 1966 .

[7] Mordecai Avriel,et al. Nonlinear programming , 1976 .

[8] Harvey J. Greenberg,et al. A Review of Quasi-Convex Functions , 1971, Oper. Res..

[9] Toshihide Ibaraki,et al. A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program , 1987, Discret. Appl. Math..

[10] Arthur M. Geoffrion,et al. Solving Bicriterion Mathematical Programs , 1967, Oper. Res..

[11] S. Schaible. Fractional Programming. II, On Dinkelbach's Algorithm , 1976 .