Second order duality for nondifferentiable minimax fractional programming
Abstract：A class of generalized second order convex function is introduced, which is called second order （ F,a,p,d,p） - univex function. Under （ F,a,p,d,p） - univexity assumption, one kind of minimax fractional programming problem is considered. The second order weak, vroblem and its dual nroblem are ohtaine, d. strong and converse duality theorems for the primal
Keywords：minimax fractional progTammirigsecond order (Fapdp ) . univexsecond order dualityoptimality conditions
Publication Date：2012-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 97-100,192 )