The purpose of the paper is to discuss the application of (p,r)-invexity for a class of minimax programming problems.

May 21, 2007 · Minimax programming problems involving generalized (p, r)-invex functions are considered. Parametric sufficient optimality conditions and ...

The generalized minimax programming problem (P), in which functions are locally Lipschitz (, )-invex), is considered and dual problem (DI) is constructed ...

In this paper, we extend (p , r)-Type I functions[7] to vector-valued case and establish sufficient optimality conditions and duality results for a minimax ...

timality conditions and duality results for a class of minimax programming problems under. (p, r)-invexity assumptions. In this paper, we extend (p, r)-Type ...

Antczak, Tadeusz, 2004. "Minimax programming under (p,r)-invexity," European Journal of Operational Research, Elsevier, vol. 158(1), pages 1-19, October.

Minimax programming problems involving generalized (p, r)-invex functions are considered. Parametric sufficient optimality conditions and duality results ...

Minimax programming problems involving (p,r)-invex functions with respect to η are considered. Parametric and non-parametric necessary and sufficient ...

Minimax programming under (p,r)-invexity. Tadeusz Antczak. European Journal of Operational Research, 2004, vol. 158, issue 1, 1-19. Date: 2004. References: View ...

Dec 3, 2012 · In this paper, we establish the sufficient optimality conditions for minmax programming and generalized fractional minmax programming ...