摘要
本文讨论了混合整数规划的精确罚函数:并给出了原规划的解和其相应的 罚问题解的等价性的几个充分条件.此外,我们提出了线性混合整数规划情况下相应的 K-K-T条件.
In this paper, we discuss exact penalty function in mixed-integer programming. Several sufficient conditions are proposed for the equivalence of the solutions between the primal programming and the penalty problem. In addition, we specify the present condition in the case of linear mixed-integer programming by using the corresponding K-K-T condition.
出处
《运筹学学报》
CSCD
北大核心
2002年第4期1-7,共7页
Operations Research Transactions
基金
ThisresearchwaspartiallysupportedbytheNationalScienceFoundationofChinaunderGrant.
关键词
混合整数规划
精确罚函数
K-K-T条件
Mixed-integer programming, exact penalty function, K-K-T condition
