Academic Editor: C. Conca
Copyright © 2013 D. H. Yuan and X. L. Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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.