On sufficiency for discrete minmax fractional programming problems involving generalized $(\theta,\eta,\rho)-V$-univex functions (Q5226779)
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: On sufficiency for discrete minmax fractional programming problems involving generalized (\theta,\eta,\rho)-V-univex functions |
scientific article; zbMATH DE number 7088195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On sufficiency for discrete minmax fractional programming problems involving generalized $(\theta,\eta,\rho)-V$-univex functions |
scientific article; zbMATH DE number 7088195 |
Statements
1 August 2019
0 references
minmax programming
0 references
fractional programming
0 references
generalized $(\theta,\eta,\rho)-V$-univex functions
0 references
parametric sufficient optimality conditions
0 references
arbitrary norms
0 references
0.9171579480171204
0 references
0.9006443619728088
0 references
0.8846787214279175
0 references
0.8845284581184387
0 references
