目的研究一类分子由可微函数和凸函数之和,分母由可微函数和凸函数之差的形式组成目标函数的广义分式规划问题。方法利用Abad ie约束条件下的最优性必要条件。结果导出此问题在(C,α,,ρd)-V-凸下的充分条件,同时建立一种对偶模型。结论其弱对偶、强对偶和严格逆对偶定理成立。
Aim To study a class of minimax fractional programming problems.Methods The kuhn-tucker type sufficient conditions is given under the assumptions of(C,α,ρ,d)-V-convexity.Results A kind of duality model was formulated.Conclusion Weak duality,strong duality and converse duality theorems are proved under the assumption of(C,α,ρ,d)-V-convexity.