Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/2633
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hachem Slimani and Mohammed Said Radjef | - |
dc.date.accessioned | 2013-12-19T14:07:00Z | - |
dc.date.available | 2013-12-19T14:07:00Z | - |
dc.date.issued | 2013-12-19 | - |
dc.identifier.issn | kh | - |
dc.identifier.uri | http://hdl.handle.net/123456789/2633 | - |
dc.description | 7 ieme Colloque sur l Optimisation et les Systèmes d’Information COSI 2010 18-20 Avril 2010 | en_US |
dc.description.abstract | In this paper, we are concerned with a differentiable multiob- jective programming problem with inequality constraints. We introduce new concepts of generalized V-type I invexity problems in which each component of the objective and constraint functions is considered with respect to its own function ηi or θj . In the setting of these definitions, we establish new Karush-Kuhn-Tucker type necessary and sufficient op- timality conditions for a feasible point to be efficient or properly efficient. Furthermore, we show, with examples, that the obtained results allow to prove that a feasible point is an efficient or properly efficient solution even if it is not an usual vector Karush-Kuhn-Tucker point for a multi- objective programming problem | en_US |
dc.language.iso | fr | en_US |
dc.subject | Multiobjective programming | en_US |
dc.subject | Generalized V-type I prob- lem | en_US |
dc.subject | Generalized Karush-Kuhn-Tucker condition | en_US |
dc.subject | Optimality | en_US |
dc.subject | (Properly) efficient point | en_US |
dc.title | Multiobjective programming under generalized V-type I invexity | en_US |
dc.type | Article | en_US |
Appears in Collections: | 1. Faculté des mathématiques et des sciences de la matière |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Hachem Slimani.pdf | 610,83 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.