Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity (Q2370040)
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: Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity |
scientific article; zbMATH DE number 5166350
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity |
scientific article; zbMATH DE number 5166350 |
Statements
Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity (English)
0 references
21 June 2007
0 references
In this paper, a sufficient conditions for optimality of \((P)\) for a class of nondifferentiable minimax fractional programming problems involving \((F, \alpha, \rho, d)\)-convexity is established. Subsequently applying the optimality conditions, two types of weak, strong and strict converse dual problems are considered and corresponding duality theorems are proved.
0 references
sublinear functionals
0 references
0 references
0 references
0 references
0.98965764
0 references
0.9844899
0 references
0.9756572
0 references
0.97525567
0 references
0.97503996
0 references
0.96796536
0 references
0.9655236
0 references
0.96508193
0 references
0.9642218
0 references
