SEMI-INFINITE MULTIOBJECTIVE PROGRAMMING WITH GENERALIZED INVEXITY
暂无分享,去创建一个
[1] W. Schmitendorf. Necessary conditions and sufficient conditions for static minmax problems , 1977 .
[2] G. Still,et al. Second order optimality conditions for generalized semi-infinite programming problems , 1995 .
[3] M. A. Hanson,et al. Further Generalizations of Convexity in Mathematical Programming , 1982 .
[4] Jane J. Ye,et al. First Order Optimality Conditions for Generalized Semi-Infinite Programming Problems , 2008 .
[5] Massimiliano Ferrara,et al. Mathematical Programming with ( Φ, ρ )-invexity , 2007 .
[6] M. A. Hanson. On sufficiency of the Kuhn-Tucker conditions , 1981 .
[7] Jean-Philippe Vial,et al. Strong and Weak Convexity of Sets and Functions , 1983, Math. Oper. Res..
[8] Kenneth O. Kortanek,et al. Semi-Infinite Programming: Theory, Methods, and Applications , 1993, SIAM Rev..
[9] Vasile Preda,et al. On efficiency and duality for multiobjective programs , 1992 .
[10] Marco A. López,et al. Linear semi-infinite programming theory: An updated survey , 2002, Eur. J. Oper. Res..
[11] B. Craven. Invex functions and constrained local minima , 1981, Bulletin of the Australian Mathematical Society.
[12] T. Weir,et al. Generalised convexity and duality in multiple objective programming , 1989, Bulletin of the Australian Mathematical Society.
[13] HettichR.,et al. Semi-infinite programming , 1979 .