On solutions and duality of nonlinear nonsmooth fractional programs

被引：0
|
作者：
Ammar, EE [1 ]
机构：
[1] Girls Fac Educ, Yanbu Al Bahr, Saudi Arabia
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2006年 / 172卷 / 02期
关键词：
nonlinear fraction programming; nondifferentiability optimization solution sets; duality;
D O I：
10.1016/j.amc.2005.02.039
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Dinkelbach's global optimization approach for finding the global maximum of the fractional programming problem is discussed. Based on this idea, we give several characterizations of the solution set of a convex-concave fractional programs. Nondifferentiability of the functions involved in the problem definition is assumed. The subgradients attaining the minimum principle are explicitly characterized, and this characterization is shown to be independent of any solution. Also a general dual is formulated and duality results are proved using concepts of dual space. (c) 2005 Elsevier Inc. All rights reserved.
引用
收藏
页码：865 / 875
页数：11
相关论文
共 50 条
12345