Optimality and duality for a class of nondifferentiable minimax fractional programming problems

Yugoslav Journal of Operations Research

关键词: Fractional programming;    generalized invexity;    optimality conditions;    duality;   

DOI  :  10.2298/YJOR0901049B

来源: DOAJ

【 摘 要 】

Necessary and sufficient optimality conditions are established for a class of nondifferentiable minimax fractional programming problems with square root terms. Subsequently, we apply the optimality conditions to formulate a parametric dual problem and we prove some duality results.

【 授权许可】

Unknown