Separation functions and optimality conditions in vector optimization (Q1686672)
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: Separation functions and optimality conditions in vector optimization |
scientific article; zbMATH DE number 6819197
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separation functions and optimality conditions in vector optimization |
scientific article; zbMATH DE number 6819197 |
Statements
Separation functions and optimality conditions in vector optimization (English)
0 references
15 December 2017
0 references
The authors consider a constrained vector optimization problem with nonconvex data. They introduce a class of nonconvex separation functions and use them to establish a relationship between efficient/weakly efficient solutions of the problem and associated Lagrangian functions. They derive also Karush-Kuhn-Tucker conditions for the problem when the data are Lipschitz continuous.
0 references
nonlinear separation
0 references
saddle points
0 references
Karush-Kuhn-Tucker condition
0 references
Lagrangian function
0 references
0 references
0 references
0 references
