diff --git a/dune/solvers/solvers/quadraticipopt.hh b/dune/solvers/solvers/quadraticipopt.hh
index 31a6e0e73430ab23977c6e0e151f06a7f4d16655..ea00e63dbf9eb754b0051006cb2e51e807568a25 100644
--- a/dune/solvers/solvers/quadraticipopt.hh
+++ b/dune/solvers/solvers/quadraticipopt.hh
@@ -131,10 +131,11 @@ bool QuadraticIPOptProblem<MatrixType,VectorType>::
 get_nlp_info(Ipopt::Index& n, Ipopt::Index& m, Ipopt::Index& nnz_jac_g,
              Ipopt::Index& nnz_h_lag, IndexStyleEnum& index_style)
 {
-    // The problem described in HS071_NLP.hpp has 4 variables, x[0] through x[3]
+    // Number of variables
     n = x_->dim();
 
-    // No equality constraints: Dirichlet conditions are actually inequality constraints
+    // No real constraints: Dirichlet conditions are actually bound inequality constraints
+    // bound constraints are handled differently by IpOpt
     m = 0;
 
     // hence the constraint jacobian is empty