Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
Barrodale I (1973) Best rational approximation and strict quasi-convexity. SIAM J Numerical Analysis 10:8–12
Bector CR and Sunneja SK (1988) Duality in nondifferentiable generalized fractional programming. Asia-Pacific J Operational Research 5:134–139
Chandra S, Craven BD and Mond B (1986) Generalized fractional programming duality: A ratio game approach. J Australian Math Soc Ser B 28:170–180
Cheney EW (1966) Introduction to Approximation Theory. McGraw Hill, New York
Collatz L (1989) Some advantages of rational approximation compared with polynomial approximation. Approximation Theory 6, ed. by Chui CK, Schumaker LL, Ward JD Academic Press, New York 145–148
Craven BD (1988) Fractional Programming, Heldermann, Berlin
Crouzeix J-P, Ferland JA and Schaible S (1983) Duality in generalized linear fractional programming. Math Progr 27:342–354
Ignizio JP (1976) Goal Programming and Extensions, Lexington Books. Lexington, Mass., USA
Jagannathan R and Schaible S (1983) Duality in generalized fractional programming via Farkas's lemma. JOTA 47:35–49
Jeyakumar V and Gwinner J (1991) Inequality systems and optimization. J Math Anal Appl 159:51–71
Jeyakumar V and Wolkowicz H (1990) Zero duality gaps in infinite dimensional programming. JOTA 67:87–108
Marchi E (1976) Equilibrium points of rationaln-person games. J Math Anal Appl 54:1–4
Meinardus G (1964) Approximation von Funktionen und ihre numerische Behandlung, Springer, Berlin
Schaible S and Ibaraki T (1983) Fractional programming. Eur J Oper Res 12:325–338
Schroeder RG (1970) Linear programming solutions to ratio games. Operations Research 18:300–305
Scott CH and Jefferson TR (1989) Conjugate duality in generalized fractional programming. JOTA 60:475–483
Singh C and Rueda N (1990) Generalized fractional programming: optimality and duality theory. JOTA 66:149–159
Studden WJ (1971) Optimal designs and spline regression. Optimizing Methods in Statistics, ed. by Rustagi JS Academic Press, New York 63–76
Author information
Authors and Affiliations
Additional information
The research was initiated while the first named author was a visitor at the University of New South Wales and was completed while the second named author was a visitor at the Technische Hochschule Darmstadt.
Rights and permissions
About this article
Cite this article
Gwinner, J., Jeyakumar, V. A solvability theorem and minimax fractional programming. ZOR - Methods and Models of Operations Research 37, 1–12 (1993). https://doi.org/10.1007/BF01415524
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01415524