Home The Notion of V-r-Invexity in Differentiable Multiobjective Programming
Article
Licensed
Unlicensed Requires Authentication

The Notion of V-r-Invexity in Differentiable Multiobjective Programming

  • T. Antczak
Published/Copyright: June 9, 2010

Abstract

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

Received: 2002-10-01
Revised: 2003-03-31
Published Online: 2010-06-09
Published in Print: 2005-June

© Heldermann Verlag

Downloaded on 22.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/JAA.2005.63/html
Scroll to top button