The problem of reachable set estimation is studied for discrete-time bilinear system in this paper. Time-varying delays and bounded input disturbances are both considered in bilinear system. The aim is to find reachable set that converges from all the states of system with initial conditions. By constructing Lyapunov–Krasovskii functional, sufficient delay-dependent less conservative stable conditions of reachable set estimation are obtained for bilinear delay system via the reciprocally convex combination and delay partition approaches. The derived theorem can guarantee that all the states of system with initial conditions from some domain are bounded in an ellipsoid and all the states from other domain are converged exponentially within a ball. One simulation example is presented to illustrate the correctness of the derived result in this paper.