摘要
在线性规划单纯形基础上，介绍0─1规划的单纯形算法。通过本文作者实践，证明行之有效并给出了算例，说明该方法的具体使用。
Based on linear programming,intreduces simplex method for resolving 0-1 programming.This method is not only directed and comprehensive,but also verified feasibility by author'spractice. The paper gives typical example in order to explain the method.
出处
《宝鸡文理学院学报（自然科学版）》
CAS
1997年第2期5-8,共4页
Journal of Baoji University of Arts and Sciences(Natural Science Edition)
