Hanson-Antczak-type generalized invex functions in semiinfinite minmax fractional programming. I: sufficient optimality conditions (Q4925719)
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 6174787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hanson-Antczak-type generalized invex functions in semiinfinite minmax fractional programming. I: sufficient optimality conditions |
scientific article; zbMATH DE number 6174787 |
Statements
12 June 2013
0 references
semiinfinite programming
0 references
discrete minmax fractional programming
0 references
Hanson-Antczak-type generalized (\(\alpha, \beta, \gamma, \eta, \rho, \theta\))-invex functions
0 references
infinitely many equality and inequality constraints
0 references
parametric sufficient optimality conditions
0 references
0.9179741144180298
0 references
0.9015166759490968
0 references
0.8985456228256226
0 references
0.8901287913322449
0 references
