Abstract
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz (, )-invex. Not only -sufficient but also -necessary optimality conditions are established for problem (P). With -necessary optimality conditions and (, )-invexity on hand, we construct dual problem (DI) for the primal one (P) and prove duality results between problems (P) and (DI). These results extend several known results to a wider class of programs.
Citation
D. H. Yuan. X. L. Liu. "Generalized Minimax Programming with Nondifferentiable (, )-Invexity." J. Appl. Math. 2013 1 - 7, 2013. https://doi.org/10.1155/2013/854125
Information