Re: [eclipse-clp-users] Teorethical Question

From: Thorsten Winterer <thorsten_winterer_at_...126...>
Date: Wed, 18 May 2011 12:01:30 +0200

from a practical point, CPLEX offers an option to find a set of 
"Irreducibly Inconsistent Constraints". I'm not sure whether it's 
possible to extract that information from CPLEX via eplex, but I would 
be interested in such an option. (Kish: how hard would it be to extend 
the eplex/CPLEX interface?)

One paper I found through Google on IIS is this:
And here is a tutorial that was presented at CPAIOR 2007:
Maybe this helps as a starting point.


On 18.05.2011 09:36, Bogdan Tanasa wrote:
> Hi,
> I am dealing with a number of linear constraints (linear inequalities) 
> and I am curious if exists some theoretical results regarding the 
> minimum number of constraints which can be violated having as an input 
> the inequalities and the domains of the variables.
> From what I read on the Internet I found articles like this: 
> Do you know similar work for the particular case when the constraints 
> are a linear combinations of variables?
> Thank you,
> Bogdan.
> ------------------------------------------------------------------------------
> What Every C/C++ and Fortran developer Should Know!
> Read this article and learn how Intel has extended the reach of its
> next-generation tools to help Windows* and Linux* C/C++ and Fortran
> developers boost performance applications - including clusters.
> _______________________________________________
> ECLiPSe-CLP-Users mailing list
Received on Wed May 18 2011 - 10:01:48 CEST

This archive was generated by hypermail 2.2.0 : Mon Jul 09 2018 - 02:05:29 CEST