论文信息 - Fractional programming duality via geometric programming duality

Fractional programming duality via geometric programming duality

Abstract A duality theory for a class of fractional programs is developed. A fractionalprogram which is non-convex is convexified using a one-to-one transformation. The resulting convex equivalent is then dualized with generalized geometric programming duality.

C. Scott | T. R. Jefferson

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

[2] C. R. Bector. Duality in nonlinear fractional programming , 1973, Z. Oper. Research.

[3] B. Craven,et al. A note on mathematical programming with fractional objective functions , 1973 .

[4] B. Craven,et al. The Dual of a Fractional Linear Program , 1973 .

[5] R. Jagannathan,et al. Duality for nonlinear fractional programs , 1973, Z. Oper. Research.

[6] R. Kaul,et al. Duality theorems for a class of nonconvex programming problems , 1973 .

[7] Siegfried Schaible,et al. Parameter-free convex equivalent and dual programs of fractional programming problems , 1974, Z. Oper. Research.

[8] Clarence Zener,et al. Geometric Programming , 1974 .

[9] S. Schaible. Fractional Programming. I, Duality , 1976 .

[10] Siegfried Schaible,et al. Duality in Fractional Programming: A Unified Approach , 1976, Oper. Res..

[11] G. A. Garreau,et al. Mathematical Programming and Control Theory , 1979, Mathematical Gazette.