%0 Journal Article
%T An Asymptotic Strong Duality |Method for Integer Programming<br>整数规划的渐进强对偶方法
%A WANG Wei
%A XU Yi-Fan
%A <br>王薇
%A 徐以凡
%J 数学物理学报(A辑)
%D 2004
%I 
%X Although the Lagrangian method is a powerful dual search method in integer programming, it often fails to identify the optimal solution of the primal problem. In this paper, a quasi dual formulation is proposed for bounded integer programming. This formulation possesses an asymptotic strong duality property and guarantees a success for identifying an optimum solution. Its another feature is that no actual dual search is needed when the parameters of the method are set to be suitable.
%K Integer programming
%K Lagrangian relaxation
%K Duality gap
%K Quasi dual formulation<br>整数规划
%K Lagrange松弛
%K 对偶间隙
%K 拟对偶公式
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=4DB553CDB5F521D8C921082E5C95EC80&aid=ECF68AE9AB012BFE&yid=D0E58B75BFD8E51C&vid=B91E8C6D6FE990DB&iid=38B194292C032A66&sid=B8F8200D88DDC7D6&eid=8BB50A069C48D50B&journal_id=1003-3998&journal_name=数学物理学报(A辑)&referenced_num=0&reference_num=14