Constraint qualifications and Farkas lemma in convex infinite programming (Q3404899)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5670960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constraint qualifications and Farkas lemma in convex infinite programming |
scientific article; zbMATH DE number 5670960 |
Statements
12 February 2010
0 references
convex inequality system
0 references
strong CC qualification
0 references
Farkas type lemma
0 references
duality
0 references
stability
0 references
0.918356478214264
0 references
0.8659222722053528
0 references
0.8651586771011353
0 references
0.8545861840248108
0 references