Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity (Q420194)
From MaRDI portal
!
WARNING
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 6037016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity |
scientific article; zbMATH DE number 6037016 |
Statements
Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity (English)
0 references
21 May 2012
0 references
Summary: We establish several sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems from a view point of generalized convexity. Subsequently, these optimality criteria are utilized as a basis for constructing dual models, and certain duality results have been derived in the framework of generalized convex functions. Our results extend and unify some known results on minimax fractional programming problems.
0 references
0 references
0 references
0 references
0 references
0 references
0.9695355892181396
0 references
0.9612947702407836
0 references
0.9367216229438782
0 references
0.929222285747528
0 references
0.9214016199111938
0 references
