Generalized invexity and duality in multiobjective programming problems (Q5927656)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1580043
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized invexity and duality in multiobjective programming problems |
scientific article; zbMATH DE number 1580043 |
Statements
Generalized invexity and duality in multiobjective programming problems (English)
0 references
14 October 2001
0 references
The paper generalizes the concept of type I functions introduced by Hanson and Mond (1987) to vector-valued functions in order to develop duality results for nonlinear multiobjective programming problems with inequality constraints. Under these generalized type I assumptions, Mond-Weir and generalized Mond-Weir type duals are formulated and the concept of efficiency is used to state weak, strong and converse duality theorems.
0 references
multiobjective programming
0 references
invexity
0 references
type I functions
0 references
duality
0 references
0.9001994132995605
0 references
0.8996577858924866
0 references
0.8984620571136475
0 references
