%0 Journal Article
%T A NEW METHOD FOR SOLVING SURROGATE DUALITY IN INTEGER PROGRAMS<br>求解整数规划代理对偶的一个新方法
%A 倪明放
%A 徐南荣
%J 计算数学
%D 1993
%I 
%X Methods for solving Lagrangean dual in integer programs have been highly developed toprovide good bounds in branch and bound procedures. While surrogate dual has been theore-tically shown to provide stronger bounds, the complexity of solving surrogate dual has dis-couraged their employment in integer programs. This paper presents a new method for solvingsurrogate duality in integer programs. The theoretical analysis and computational examplesshow that the method proposed is efficient.
%K 整数规划
%K 线性规划
%K 代理对偶问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=CC77F3CEF526D9CF0B3021650FB4E57E&aid=53EC5B0FEF8A57625B9CC300152F1570&yid=D418FDC97F7C2EBA&vid=23CCDDCD68FFCC2F&iid=0B39A22176CE99FB&sid=3F0AF5EDBC960DB0&eid=F260CE035846B3B8&journal_id=0254-7791&journal_name=计算数学&referenced_num=2&reference_num=2