期刊名称：Current Journal of Applied Science and Technology
印刷版ISSN：2457-1024
出版年度：2019
卷号：34
期号：6
页码：1-6
DOI：10.9734/cjast/2019/v34i630155
语种：English
出版社：Sciencedomain International
摘要：In branch and bound algorithm for integer linear programming the usual approach is incorporating dual simplex method to achieve feasibility for each sub-problem. Although one can also employ the phase 1 simplex method but the simplicity and easy implementation of the dual simplex method bounds the users to use it. In this paper a new technique for handling sub-problems in branch and bound method has been presented, which is an efficient alternative of dual simplex method.
关键词：Integer programming;branch and bound method;dual simplex algorithm;two-phase simplex method
