Optimization theory for set functions in nondifferentiable fractional programming with mixed type duality (Q1012949)
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 5548650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimization theory for set functions in nondifferentiable fractional programming with mixed type duality |
scientific article; zbMATH DE number 5548650 |
Statements
Optimization theory for set functions in nondifferentiable fractional programming with mixed type duality (English)
0 references
28 April 2009
0 references
The authors consider a minimax fractional programming problem involving subdifferentiable set functions. A dual model of mixed type is introduced which contains the Wolfe type dual and the Mond-Weir type dual as its special cases. The weak, strong and strict converse duality theorems are established under certain generalized convexity hypotheses.
0 references
duality theorems
0 references
subdifferentiable set functions
0 references
convex set functions
0 references
generalized convex set functions
0 references
convex family of measurable sets
0 references
0.8850805163383484
0 references
0.8745414018630981
0 references
0.8618467450141907
0 references
0.8611227869987488
0 references
0.8550378084182739
0 references
