Continuous‐Time Multiobjective Optimization Problems via Invexity

Valeriano A. De Oliveira and Marko A. Rojas-Medar

Abstract and Applied Analysis, 2007, vol. 2007, issue 1

Abstract: We introduce some concepts of generalized invexity for the continuous‐time multiobjective programming problems, namely, the concepts of Karush‐Kuhn‐Tucker invexity and Karush‐Kuhn‐Tucker pseudoinvexity. Using the concept of Karush‐Kuhn‐Tucker invexity, we study the relationship of the multiobjective problems with some related scalar problems. Further, we show that Karush‐Kuhn‐Tucker pseudoinvexity is a necessary and suffcient condition for a vector Karush‐Kuhn‐Tucker solution to be a weakly efficient solution.

Date: 2007
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2007/61296

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2007:y:2007:i:1:n:061296

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().