Re: [Help-glpk] Re: Simplex method infeasible, IP method feasible

[Nicolo' Giorgetti]

> 
> Why infeasible? I tried your example with both simplex and interior.
> Here are the results below.

Ok, but If you check the constraints, A*xmin -b <= 0, you'll find that
some constraints are violated:

A*xmin-b =

  1.0000e-004
 -5.0000e-004
 -8.3020e+001
 -9.8723e+001
 -6.4050e-005
 -9.2220e-006

BTW, lpx_get_status() returns 183 (LPX_NOFEAS) and it is correct.

If you consider xmin of the interior point method

A*xmin-b =

  2.5000e-003
  1.3000e-003
 -8.3015e+001
 -9.8720e+001
 -1.3258e-003
 -4.9793e-003



Regards,
Nicolo'.