Abstract and Applied Analysis

Continuous-Time Multiobjective Optimization Problems via Invexity

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

Full-text: Open access

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.

Article information

Source
Abstr. Appl. Anal., Volume 2007 (2007), Article ID 61296, 11 pages.

Dates
First available in Project Euclid: 23 March 2007

Permanent link to this document
https://projecteuclid.org/euclid.aaa/1174668657

Digital Object Identifier
doi:10.1155/2007/61296

Mathematical Reviews number (MathSciNet)
MR2283963

Zentralblatt MATH identifier
1180.90286

Citation

De Oliveira, Valeriano A.; Rojas-Medar, Marko A. Continuous-Time Multiobjective Optimization Problems via Invexity. Abstr. Appl. Anal. 2007 (2007), Article ID 61296, 11 pages. doi:10.1155/2007/61296. https://projecteuclid.org/euclid.aaa/1174668657


Export citation