(p,r)-Invexity in multiobjective programming

(p,r)-Invexity in multiobjective programming

0.00 Avg rating—0 Votes
Article ID: iaor20051547
Country: Netherlands
Volume: 152
Issue: 1
Start Page Number: 72
End Page Number: 87
Publication Date: Jan 2004
Journal: European Journal of Operational Research
Authors:
Abstract:

In this paper, a generalization of convexity, namely (p,r)-invexity, is considered in the case of nonlinear multiobjective programming problems where the functions involved are differentiable. The ssumptions on Pareto solutions are relaxed by means of (p,r)-invex functions. Also some duality results are obtained for such optimization problems.

Reviews

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