Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity (Q2370040): 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-9057-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086174021 / rank | |||
Normal rank | |||
Revision as of 19:09, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity |
scientific article |
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
