论文信息 - On duality theorems for a nondifferentiable minimax fractional programming

On duality theorems for a nondifferentiable minimax fractional programming

The optimality conditions of [Lai et al. (J. Math. Anal. Appl. 230 (1999) 311)] can be used to construct two kinds of parameter-free dual models of nondifferentiable minimax fractional programming problems which involve pseudo-/quasi-convex functions. In this paper, the weak duality, strong duality, and strict converse duality theorems are established for the two dual models.

J. C. Lee | H. C. Lai

[1] Ruey-Lin Sheu,et al. Duality for Fractional Minimax Programming ∗ ∗The research is partly supported by NSC, Taiwan.$ef: , 1997 .

[2] R. N. Mukherjee,et al. Duality for fractional minimax programming problems , 1990, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[3] Kensuke Tanaka,et al. Duality Without a Constraint Qualification for Minimax Fractional Programming , 1999 .

[4] J. C. Liu,et al. On Minimax Fractional Programming of Generalized Convex Set Functions , 2000 .

[5] S. Chandra,et al. Duality in fractional minimax programming , 1995, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[6] W. Schmitendorf. Necessary conditions and sufficient conditions for static minmax problems , 1977 .

[7] C. S Wu,et al. On minimax fractional optimality conditions with (F, ρ)-convexity , 1998 .

[8] J. C Liu,et al. On Minimax Fractional Optimality Conditions with Invexity , 1998 .

[9] Hang-Chin Lai,et al. Duality for a Minimax Programming Problem Containingn-Set Functions , 1999 .

[10] Kensuke Tanaka,et al. Necessary and sufficient conditions for minimax fractional programming , 1999 .