Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity (Q2370036): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10957-006-9052-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042529475 / rank | |||
Normal rank | |||
Revision as of 18:54, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity |
scientific article |
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
