Inspired by classical sensitivity results for nonlinear optimization, we derive and discuss new quantitative bounds to characterize the solution map dual variables of a parametrized program. In particular, explicit expressions local global Lipschitz constants nonconvex or convex optimization problems, respectively. Our are geared towards study time-varying which commonplace in various applicati...