[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## RE: [Help-glpk] infeasible solution support

**From**: |
design |

**Subject**: |
RE: [Help-glpk] infeasible solution support |

**Date**: |
Mon, 7 Apr 2008 15:31:26 +0400 |

I practically use technique like MIP infeasible analysis. It is work.
That is why I written "I do not agree". If the problem contains many
types of constraints then you have no chance find the contradiction
manually. Is not it? I can give you an example.
What about "number of mip instances" do you say? 1 original problem
converted to 1 "analysis" problem. Number of integer variables not
changed... Could you please explain difficulty more detailed?
-----Original Message-----
From: Andrew Makhorin [mailto:address@hidden
Sent: Monday, April 07, 2008 11:25 AM
To: address@hidden
Cc: address@hidden
Subject: Re: [Help-glpk] infeasible solution support
>* Andrew, I do not agree.*
With what do you not agree?
I did not say that it is impossible to determine a minimal/irreducible
infeasible system for mip. I only said that this is impractical. It is
always possible to minimize the sum of residuals, however, to obtain
the minimal/irreducible system one should solve a number of mip
instances that makes such analysis impractical in non-trivial cases.