Abstract: A delimitative and combinatorial algorithm for a kind of (0,1) programming is advanced in this paper. The algorithm proposed here defines the lower bound according to the constraint conditions, and then the upper bound in accordance to the objective function, with a lot of unfeasible or non-optimum combinations being eliminated in searching process, computational effort being decreased, and effectiveness being increased significantly.