title: Is there any quadratic programming function that can have both lower and upper bounds - Python
body: <p>Normally I have been using <a href="https://octave.sourceforge.io/optim/function/quadprog.html" rel="noreferrer">GNU Octave</a> to solve quadratic programming problems.</p>
  
  <p>I solve problems like</p>
  
  <pre><code>x = 1/2x'Qx + c'x
  </code></pre>
  
  <p>With subject to</p>
  
  <pre><code>A*x &lt;= b
  lb &lt;= x &lt;= ub
  </code></pre>
  
  <p>Where <code>lb</code> and <code>ub</code> are lower bounds and upper bounds, e.g limits for <code>x</code></p>
  
  <p>My Octave code looks like this when I solve. Just one simple line</p>
  
  <pre><code>U = quadprog(Q, c, A, b, [], [], lb, ub);
  </code></pre>
  
  <p>The square brackets <code>[]</code> are empty because I don't need the equality constraints </p>
  
  <pre><code>Aeq*x = beq,
  </code></pre>
  
  <p>So my question is:
  Is there a easy to use quadratic solver in Python for solving problems</p>
  
  <pre><code>x = 1/2x'Qx + c'x
  </code></pre>
  
  <p>With subject to</p>
  
  <pre><code>A*x &lt;= b
  lb &lt;= x &lt;= ub
  </code></pre>
  
  <p>Or subject to</p>
  
  <pre><code>b_lb &lt;= A*x &lt;= b_ub
  lb &lt;= x &lt;= ub
  </code></pre>