title: using cvxopt for LP problems with only Aeq=beq (no constraints with A*x<=b)
body: <p>I am trying to solve a linear programming problem of the form</p>
  
  <pre><code>minimise cT.x
  A.x = b
  x &gt;= 0
  </code></pre>
  
  <p>for a transportation problem.</p>
  
  <p>However, using CVXOPT requires defining the variables G.x &lt;= h for the lp(G,h,A,b) solver.</p>
  
  <p>I have tried creating my A and b matrices, and for the G and h matrices i use a identity matrix for G (multiplied by -1) and a vector of zeros for h, so as to impose the x>=0 constraints.</p>
  
  <p>However, when i run my code, it returns a "singular KKT matrix".</p>
  
  <p>Could anyone help me with what is the problem, or how i can run the CVXOPT solver without a G and h variables. </p>