Dynamic constrained-Stackelberg equilibrium problems involve two players with different information access, where the Leader controls the game by using incentive strategies with threats. This study focuses on a specific case and introduces a new approach based on bilevel mathematical programming. By applying this method to various scenarios, the researchers were able to validate the framework and discuss their computational results.