In this talk, we consider the efficient and reliable solution of distributed optimal control problems governed by parametrized elliptic partial differential equations involving constraints on the control. The reduced basis method is used as a low-dimensional surrogate model to solve the optimal control problem. To this end, we introduce reduced basis spaces not only for the state and adjoint variable but also for the distributed control variable and propose rigorous error bounds for the error in the optimal control. The reduced basis optimal control problem and associated a posteriori error bounds can be efficiently evaluated in an offline-online computational procedure, thus making our approach relevant in the many-query or real-time context. We present numerical results for a model problem to show the validity of our approach.Many problems in science and engineering can be modeled in terms of optimal control problems governed by parametrized partial differential equations (PDEs). While the PDE describes the underlying system or component behavior, the parameters often serve to identify a particular configuration of the component -such as boundary and initial conditions, material properties, and geometry. In such cases -in addition to solving the optimal control problem itself -one is often interested in exploring many different parameter configurations and thus in speeding up the solution of the optimal control problem. However, using classical discretization techniques such as finite elements or finite volumes even a single solution is often computationally expensive and time-consuming, a parameter-space exploration thus prohibitive. One way to decrease the computational burden is the surrogate model approach, where the original high-dimensional model is replaced by a reduced order approximation. These ideas have received a lot of attention in the past and various model order reduction techniques have been used in this context. However, the solution of the reduced order optimal conThis work was supported by the Excellence Initiative of the German federal and state governments and the German Research Foundation through Grant GSC 111. trol problem is generally sub-optimal and reliable error estimation is thus crucial. Besides serving as a certificate of fidelity for the sub-optimal solution, our a posteriori error bounds are also a crucial ingredient in generating the reduced basis with greedy algorithms. A new approach for efficient computation of error bounds for unconstrained distributed control problems was proposed in Kärcher et al. (2014). This approach, however, and all other existing approaches in the literature, see e.g. Negri et al. (2013); Negri (2011); Rozza et al. (2012), are not directly applicable to the important case with additional constraints on the control. In this work we extend the methodology presented in Zhang et al. (2014) to consider PDE-constrained optimal control problems. The authors in Zhang et al. (2014) develop a certified Reduced Basis (RB) method that provides sharp and inexpens...