Symmetric duality for minimax variational problems
暂无分享,去创建一个
Abstract. Wolfe and Mond-Weir type symmetric minimax dual variational problems are formulated and usual duality theorems are established under convexity-concavity and pseudoconvexity-pseudoconcavity hypotheses respectively on the function that appears in the two distinct dual pairs. Under an additional condition on the function the minimax variational problems are shown to be self duals. It is also discussed that our duality theorems can be viewed as dynamic generalization of the corresponding (static) symmetric and self duality theorems of minimax nonlinear mixed integer programming.
[1] B. Mond,et al. Generalized concavity and duality in continuous programming , 1984 .
[2] M. A. Hanson,et al. Duality for variational problems , 1967 .
[3] Egon Balas,et al. MINIMAX AND DUALITY FOR LINEAR AND NONLINEAR MIXED-INTEGER PROGRAMMING , 1969 .
[4] B. Mond,et al. Symmetric duality with invexity in variational problems , 1990 .
[5] M. A. Hanson,et al. Symmetric duality for variational problems , 1968 .