Minimax programming under (p,r)-invexity
Minimax programming problems involving (p,r)-invex functions with respect to ? are considered. Parametric and non-parametric necessary and sufficient optimality conditions and duality results for a class of minimax programming problems are obtained under (p,r)-invexity assumption on objective and constraint functions. Some different types of dual problems are introduced and duality theorems is established for each dual problem.
minimax programming (p r)-invex function with respect to ? optimality conditions duality