论文信息 - A solvability theorem and minimax fractional programming

A solvability theorem and minimax fractional programming

This paper presents a stable solvability theorem for general inequality systems under a local closedness condition. It is shown how this mild regularity condition can be characterized by the validity of the solvability theorem for all local perturbations. Based on this solvability theorem zero duality gap and stability are established for general minimax fractional programming problems.

Joachim Gwinner | Vaithilingam Jeyakumar

[1] Generalized fractional programming: Optimality and duality theory , 1990 .

[2] Ezio Marchi,et al. Equilibrium points of rational n-person games , 1976 .

[3] Roger G. Schroeder,et al. Linear Programming Solutions to Ratio Games , 1970, Oper. Res..

[4] Jacques A. Ferland,et al. Duality in generalized linear fractional programming , 1984, Math. Program..

[5] Vaithilingam Jeyakumar,et al. Inequality systems and optimization , 1991 .

[6] Siegfried Schaible,et al. Duality in generalized fractional programming via Farkas' lemma , 1983 .

[7] W. J. Studden. OPTIMAL DESIGNS AND SPLINE REGRESSION , 1971 .

[8] B. Mond,et al. Generalized fractional programming duablity: a ratio game approach , 1986, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[9] E. Cheney. Introduction to approximation theory , 1966 .

[10] I. Barrodale. Best Rational Approximation and Strict Quasi-Convexity , 1973 .

[11] G. Meinardus. Approximation von Funktionen und ihre numerische Behandlung , 1964 .

[12] C. Scott,et al. Conjugate duality in generalized fractional programming , 1989 .

[13] Henry Wolkowicz,et al. Zero duality gaps in infinite-dimensional programming , 1990 .

[14] Roger M. Y. Ho,et al. Goal programming and extensions , 1976 .