期刊文献+

非凸规划的对偶问题极值

OPTIMAL VALUE OF DUAL PROBLEM FOR NONCONVEX PROGRAMMING
下载PDF
导出
摘要 本文对非凸规划的对偶问题的目标函数极值给出一个表达式 ,从而得出对偶间隙 ,使用的方法是扰动函数的凸色 。 This paper gives an expression of the optimal value of objective function for the dual problem of nonconvex programming by using the convex hull of perturbation function without any convexity assumtion,and further gets an expression of duality gap.
出处 《经济数学》 2004年第1期68-71,共4页 Journal of Quantitative Economics
关键词 对偶问题 对偶间隙 函数的凸色 扰动函数 Dual problem,duality gap,convex hull of a function,pertubation function
  • 相关文献

参考文献5

  • 1[1]Papplardo,On the duality gap in nonconvex optimization,Math. Opert. Res,11(1986),30-35.
  • 2[2]Aubin,J. P. and Ekland ,J. ,Estimates of the cluality gap in nonconvex optimization,Math. Opert. Res. ,1(1976) ,225-245.
  • 3[3]Di Guglielme,F. ,Estimates of the duality gap for discrete and quasiconvex optimization peoblems,Generalized Convexity in Optimization and Economics,Economics,Edited by S. Schaible and W. Ziemba,Academics ,Edited by S. Schaible and W. Ziemba ,Academics Press ,New York, 1981,281-298.
  • 4[4]Luenbeger,D. G. ,Optimization by Vector Space Methods,John Wiley ard Sons,New York,1969.
  • 5[5]Rockafellar, R. T. ,Convex Analysis,Princeton University Press ,Princeton,N. J, 1971.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部