Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method (Q623228)
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: Saddle points criteria in nondifferentiable multiobjective programming with V-invex functions via an -approximation method |
scientific article; zbMATH DE number 5851237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method |
scientific article; zbMATH DE number 5851237 |
Statements
Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method (English)
0 references
13 February 2011
0 references
\(\eta \)-approximated vector optimization problem
0 references
\(\eta \)-saddle point
0 references
vector-valued \(\eta \)-Lagrange function
0 references
\(V\)-invex function
0 references
0 references
0 references
0 references
0 references
0 references
0.9471337
0 references
0.94137824
0 references
0.91877204
0 references
0.91736674
0 references
0.9159737
0 references
0.9145728
0 references
0.91408056
0 references
0.90673697
0 references
