Minimax fractional programming problem with \((p,r)-\rho-(\eta,\theta)\)-invex functions (Q4685167)
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 6948157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimax fractional programming problem with \((p,r)-\rho-(\eta,\theta)\)-invex functions |
scientific article; zbMATH DE number 6948157 |
Statements
5 October 2018
0 references
minimax fractional programming
0 references
\((p,r)-\rho-(\eta,\theta)\)-invexity
0 references
efficiency
0 references
sufficiency
0 references
duality
0 references
0.9341691732406616
0 references
0.9143533110618592
0 references
0.9105756878852844
0 references
0.9100393652915956
0 references
