title: lpsolve - unfeasible solution, but I have example of 1
body: <p>I'm trying to solve this in LPSolve IDE:</p>
  
  <pre><code>/* Objective function */
  min: x + y;
  
  /* Variable bounds */
  r_1: 2x = 2y;
  r_2: x + y = 1.11 x y;
  r_3: x &gt;= 1;
  r_4: y &gt;= 1;
  </code></pre>
  
  <p>but the response I get is:</p>
  
  <pre><code>Model name:  'LPSolver' - run #1
  Objective:   Minimize(R0)
  
  SUBMITTED
  Model size:        4 constraints,       2 variables,            5 non-zeros.
  Sets:                                   0 GUB,                  0 SOS.
  
  Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
  The primal and dual simplex pricing strategy set to 'Devex'.
  
  The model is INFEASIBLE
  lp_solve unsuccessful after 2 iter and a last best value of 1e+030
  </code></pre>
  
  <p>How come this can happen when <code>x=1.801801802</code> and <code>y=1.801801802</code> are possible solutions here?</p>