Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity (Q2370036)
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 5166347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity |
scientific article; zbMATH DE number 5166347 |
Statements
Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity (English)
0 references
21 June 2007
0 references
To relax the convexity assumptions imposed on the theorems on sufficient optimality conditions and duality, various generalized convexity notations have been proposed in the literature. In this paper the authors consider optimality conditions and duality theorems for the generalized fractional nondifferentiable programming in the framework of a new unified formulation of generalized convexity, called \((C,\alpha,\rho,d)\)-convexity.
0 references
minimax fractional programming problem
0 references
necessary conditions
0 references
sufficent conditions
0 references
duality theory
0 references
0 references
0 references
0 references
0 references
0 references
0.9392972588539124
0 references
0.9269278645515442
0 references
0.9034699201583862
0 references
0.9031568169593812
0 references
