Minimax programming under (p,r)-invexity

Minimax programming under (p,r)-invexity

0.00 Avg rating0 Votes
Article ID: iaor20052807
Country: Netherlands
Volume: 158
Issue: 1
Start Page Number: 1
End Page Number: 19
Publication Date: Oct 2004
Journal: European Journal of Operational Research
Authors:
Keywords: duality, programming (minimax)
Abstract:

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 are established for each dual problem.

Reviews

Required fields are marked *. Your email address will not be published.