Higher-order duality in nondifferentiable minimax programming with generalized type I functions (Q1029274)
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: Higher-order duality in nondifferentiable minimax programming with generalized type I functions |
scientific article; zbMATH DE number 5577265
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Higher-order duality in nondifferentiable minimax programming with generalized type I functions |
scientific article; zbMATH DE number 5577265 |
Statements
Higher-order duality in nondifferentiable minimax programming with generalized type I functions (English)
0 references
10 July 2009
0 references
A unified higher-order dual for a nondifferentiable minimax programming problem in the \(n\)-dimensional Euclidean space is formulated and some weak, strong and strict converse duality theorems under higher-order \((F,\alpha,\rho,d)\)-type I assumptions are established in this paper. The results extend the corresponding results of the second order duality problem.
0 references
weak duality
0 references
strong duality
0 references
strict converse duality
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9565357
0 references
0.9554538
0 references
0.95026577
0 references
0.94313735
0 references
0.9301561
0 references
0.92980486
0 references
0.9287095
0 references
0.92310464
0 references
0.9208374
0 references
