This paper proposes a dynamic constrained many-objective optimization method for solving constrained optimization problems. We first convert a constrained optimization problem (COP) into an equivalent dynamic constrained many-objective optimization problem (DCMOP), then present many-objective optimization evolutionary algorithm with dynamic constraint handling mechanism, called MaDC, to solve the DCMOP, thus the COP is addressed. MaDC uses DE as the search engine, and reference-point-based nondominated sorting approach to select individuals to construct next population. The effectiveness of MaDC has been verified by comparing with peer algorithms.