title: Certificate of infeasibility in python's linprog
body: <p>I have an infeasible linear program in linprog and I would like to get a certificate of infeasibility. Formally, my linear program is of the form
  <code>Ax &lt;= b, x &gt;= 0</code> and I want a vector v&gt;=0 satisfying <code>v^T*A &gt;= 0, v^T*b &lt; 0</code>. Here is the output of the <strong>linprog</strong> call for my linear program:</p>
  <pre><code> con: array([1.50333333])
   fun: 0.0
   message: &quot;Phase 1 of the simplex method failed to find a feasible solution. The pseudo-  objective function evaluates to 4.5e+00 which exceeds the required tolerance of 1e-09 for a solution to be considered 'close enough' to zero to be a basic solution. Consider increasing the tolerance to be greater than 4.5e+00. If this tolerance is unacceptably  large the problem may be infeasible.&quot;
   nit: 8
   slack: array([ 0.        ,  0.        ,  0.        ,  0.        ,  1.50333333,
      1.50333333, -1.51335556, -1.51335556,  0.        ,  0.        ])
   status: 2
   success: False
   x: array([0., 0., 0., 0., 0., 0.])
  </code></pre>
  <p>What is the easiest way to achieve this?</p>