摘要
本文讨论目标函数和约束函数皆为凸函数的整规划问题.首先利用精确罚函数把整凸规划求解化为求凸函数极小整解问题,还讨论了凸函数极小整解的最优性条件.
In this paper,we discuss the integer convex programming.First,we convert this problem into a finding the minimized integer solution of a convex function,which using the exact penalty approach,then we also discuss the optimility condition of this problem.
基金
国家自然科学基金资助
关键词
整凸规划
精确罚函数
最优性条件
integer convex programming
exactpenalty function
optimility condition
