[PDF][PDF] On nondifferentiable minimax fractional Programming with square root terms
A Batatorescu, M Beldiman, I Antonescu… - Yugoslav Journal of …, 2009 - Citeseer
A Batatorescu, M Beldiman, I Antonescu, R Ciumara
Yugoslav Journal of Operations Research, 2009•CiteseerWe establish necessary and suffi cient optimality condition for a class of nondifferen# tiable
minimax fractional programming problems with square root terms involving (η, p, θ)# invex
funtions. Subsequently, we apply the optimality condition to formu# late a parametric dual
problem and we prove weak duality, strong duality, and strict converse duality theorems.
minimax fractional programming problems with square root terms involving (η, p, θ)# invex
funtions. Subsequently, we apply the optimality condition to formu# late a parametric dual
problem and we prove weak duality, strong duality, and strict converse duality theorems.
Abstract
We establish necessary and suffi cient optimality condition for a class of nondifferen# tiable minimax fractional programming problems with square root terms involving (η, p, θ)# invex funtions. Subsequently, we apply the optimality condition to formu# late a parametric dual problem and we prove weak duality, strong duality, and strict converse duality theorems.
Citeseer
以上显示的是最相近的搜索结果。 查看全部搜索结果