We consider and compare two subgradient type methods ("simple' and r-algorithm) for finding lower bounds in branch-and-bound method while solving allocation type problem with new kinds of discounts in the objective function. ...