Generalized invexity and duality in multiobjective programming problems (Q5927656): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:30, 30 January 2024
scientific article; zbMATH DE number 1580043
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
