Separation functions and optimality conditions in vector optimization (Q1686672): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10957-016-1029-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2559302081 / rank | |||
Normal rank | |||
Revision as of 02:20, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separation functions and optimality conditions in vector optimization |
scientific article |
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
