Higher-order duality in nondifferentiable minimax programming with generalized type I functions (Q1029274): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:19, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Higher-order duality in nondifferentiable minimax programming with generalized type I functions |
scientific article |
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
