Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity (Q2370040): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:06, 2 February 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
