论文信息 - An algorithm for a class of nonlinear fractional problems using ranking of the vertices - 字舞流文

An algorithm for a class of nonlinear fractional problems using ranking of the vertices

In this note we consider an algorithm for quasiconcave nonlinear fractional programming problems, based on ranking the vertices of a linear fractional programming problem and techniques from global optimization.

Panos M. Pardalos

[1] Panos M. Pardalos,et al. Global minimization of large-scale constrained concave quadratic problems by separable programming , 1986, Math. Program..

[2] J. B. Rosen,et al. Methods for global concave minimization: A bibliographic survey , 1986 .

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

[4] Ranking of vertices in the linear fractional programming problem , 1983 .

[6] A. Victor Cabot,et al. Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points , 1970, Oper. Res..

[7] Katta G. Murty,et al. Solving the Fixed Charge Problem by Ranking the Extreme Points , 1968, Oper. Res..

[8] T. H. Matheiss,et al. A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets , 1980, Math. Oper. Res..

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