Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions (Q1827235)
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: Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions |
scientific article; zbMATH DE number 2082277
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions |
scientific article; zbMATH DE number 2082277 |
Statements
Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions (English)
0 references
6 August 2004
0 references
Minmax fractional subset programming
0 references
Generalized \(n\)-set convex functions
0 references
Sufficient optimality conditions
0 references
Duality theorems
0 references
