Continuous-Time Multiobjective Optimization Problems via Invexity
Log in :: RSS/Atom Feeds
Abstract and Applied Analysis

Continuous-Time Multiobjective Optimization Problems via Invexity

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

Source: Abstr. Appl. Anal. Volume 2007 (2007), 11 pages.

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.

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.aaa/1204126584
Digital Object Identifier: doi:10.1155/2007/61296
Mathematical Reviews number (MathSciNet): MR2283963


2008 © Hindawi Publishing Corporation