论文信息 - On symmetric duality in mathematical programming with F-convexity

On symmetric duality in mathematical programming with F-convexity

Under F-Convexity F-Concavity F-Pseudoconvexity F-Pseudoconcavity, appropriate duality results for pair of Wolfe and Mond-Weir type symmetric dual non linear programming problems are established. These duality results are then used to investigate duality for minimax versions of symmetric dual models wherein some of the primal and dual variables are constrained to belong to some arbitrary sets. e.g., the sets of integers.

[1] Egon Balas,et al. MINIMAX AND DUALITY FOR LINEAR AND NONLINEAR MIXED-INTEGER PROGRAMMING , 1969 .

[2] M. A. Hanson,et al. On duality with generalized convexity , 1984 .

[3] R. Cottle,et al. Self-Duality in Mathematical Programming , 1966 .

[4] Vasile Preda,et al. On efficiency and duality for multiobjective programs , 1992 .

[5] V. Kumar,et al. Symmetric duality for minimax nonlinear mixed integer programming , 1995 .

[6] Suresh Chandra,et al. Symmetric dual fractional programming , 1985, Z. Oper. Research.

[7] G. Dantzig,et al. Symmetric dual nonlinear programs. , 1965 .

[8] M. A. Hanson,et al. Further Generalizations of Convexity in Mathematical Programming , 1982 .

[9] V. Kumar,et al. Symmetric duality for multiplicatively separable fractional mixed integer programming problem , 1996 .

[10] Mokhtar S. Bazaraa,et al. On Symmetric Duality in Nonlinear Programming , 1973, Oper. Res..

[11] W. S. Dorn,et al. Self-Dual Quadratic Programs , 1961 .

[12] B. Mond,et al. A symmetric dual theorem for non-linear programs , 1965 .