Duality without a constraint qualification for minimax fractional programming (Q1293955)
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 without a constraint qualification for minimax fractional programming |
scientific article; zbMATH DE number 1310608
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Duality without a constraint qualification for minimax fractional programming |
scientific article; zbMATH DE number 1310608 |
Statements
Duality without a constraint qualification for minimax fractional programming (English)
0 references
29 June 1999
0 references
generalized fractional programming
0 references
cone of directions
0 references
duality
0 references
0 references
0 references
0.8959108591079712
0 references
0.8581880331039429
0 references
0.8570662140846252
0 references
0.8446438908576965
0 references
