×

A solvability theorem and minimax fractional programming. (English) Zbl 0788.90069

Solvability theorems, of Gordan and Farkas type, are obtained for general inequality systems, under some convex and local closedness assumptions. The local closedness is characterized by stability of the solvability condition to all local perturbations. The results are applied to minimax fractional programs. Zero duality gap and stability results are obtained.

MSC:

90C32 Fractional programming
Full Text: DOI

References:

[1] Barrodale I (1973) Best rational approximation and strict quasi-convexity. SIAM J Numerical Analysis 10:8-12 · Zbl 0262.41034 · doi:10.1137/0710002
[2] Bector CR and Sunneja SK (1988) Duality in nondifferentiable generalized fractional programming. Asia-Pacific J Operational Research 5:134-139 · Zbl 0715.90089
[3] 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 · Zbl 0616.90079 · doi:10.1017/S0334270000005282
[4] Cheney EW (1966) Introduction to Approximation Theory. McGraw Hill, New York · Zbl 0161.25202
[5] 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 · Zbl 0705.41019
[6] Craven BD (1988) Fractional Programming, Heldermann, Berlin · Zbl 0638.90063
[7] Crouzeix J-P, Ferland JA and Schaible S (1983) Duality in generalized linear fractional programming. Math Progr 27:342-354 · Zbl 0526.90083 · doi:10.1007/BF02591908
[8] Ignizio JP (1976) Goal Programming and Extensions, Lexington Books. Lexington, Mass., USA
[9] Jagannathan R and Schaible S (1983) Duality in generalized fractional programming via Farkas’s lemma. JOTA 47:35-49 · Zbl 0502.90079
[10] Jeyakumar V and Gwinner J (1991) Inequality systems and optimization. J Math Anal Appl 159:51-71 · Zbl 0734.90089 · doi:10.1016/0022-247X(91)90221-K
[11] Jeyakumar V and Wolkowicz H (1990) Zero duality gaps in infinite dimensional programming. JOTA 67:87-108 · Zbl 0687.90077 · doi:10.1007/BF00939737
[12] Marchi E (1976) Equilibrium points of rationaln-person games. J Math Anal Appl 54:1-4 · Zbl 0324.90095 · doi:10.1016/0022-247X(76)90230-4
[13] Meinardus G (1964) Approximation von Funktionen und ihre numerische Behandlung, Springer, Berlin · Zbl 0124.33103
[14] Schaible S and Ibaraki T (1983) Fractional programming. Eur J Oper Res 12:325-338 · Zbl 0529.90088 · doi:10.1016/0377-2217(83)90153-4
[15] Schroeder RG (1970) Linear programming solutions to ratio games. Operations Research 18:300-305 · Zbl 0195.21201 · doi:10.1287/opre.18.2.300
[16] Scott CH and Jefferson TR (1989) Conjugate duality in generalized fractional programming. JOTA 60:475-483 · Zbl 0632.90076 · doi:10.1007/BF00940349
[17] Singh C and Rueda N (1990) Generalized fractional programming: optimality and duality theory. JOTA 66:149-159 · Zbl 0679.90080 · doi:10.1007/BF00940538
[18] Studden WJ (1971) Optimal designs and spline regression. Optimizing Methods in Statistics, ed. by Rustagi JS Academic Press, New York 63-76
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.