Duality for generalized convex multiobjective programming without a constraint qualification (Q1322044)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Duality for generalized convex multiobjective programming without a constraint qualification |
scientific article; zbMATH DE number 562427
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Duality for generalized convex multiobjective programming without a constraint qualification |
scientific article; zbMATH DE number 562427 |
Statements
Duality for generalized convex multiobjective programming without a constraint qualification (English)
0 references
19 January 1995
0 references
Some weak and strong duality results for a pair of multiobjective nonlinear programming problems without a constraint qualification are presented. These results transpose in the context of multiobjective programming some duality results given by Weir and Mond in generalized convex programming.
0 references
weak and strong duality results
0 references
multiobjective nonlinear programming
0 references
constraint qualification
0 references
duality results
0 references
0.9568983
0 references
0.9451949
0 references
0.94105417
0 references
