论文信息 - A class of multiple-criteria fractional programming problems

A class of multiple-criteria fractional programming problems

Abstract Multiple-criteria nonlinear programming results are extended to a class of nonlinear fractional programming problems. Some duality and optimality theorems of standard nonlinear programming are established for the multiple criteria fractional programming problems being considered. They are the converse duality theorems and the Fritz-John-type sufficient conditions.

Chanchal Singh | C. Singh

[1] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .

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

[3] C. Singh. Optimality conditions in fractional programming , 1981 .

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

[5] C. Singh. Convex programming with set-inclusive constraints and its applications to generalized linear and fractional programming , 1982 .

[6] S. Schaible. Fractional programming: Applications and algorithms , 1981 .

[7] Chanchal Singh. Optimality conditions for fractional minmax programming , 1984 .

[8] E. Choo,et al. Bicriteria linear fractional programming , 1982 .

[9] G. R. Bitran,et al. Duality for nonlinear multiple-criteria optimization problems , 1981 .

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