In this paper, the authors successfully use a revised Dakin's branch-and-bound method to solve the problem of mixed-integer multiple objective programming with linear fractional objectives, presenting a concept of elastic constraint and a method of treating it and a two-step method of interactive branch-and-bound from practice. Finally, they are used to solve some practical problems.