<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<div class="moz-cite-prefix">Victor,<br>
<br>
If you can give me enough to reproduce it should be simple to find
- given that primal infeasibility it looks like a bug.<br>
<br>
John Forrest<br>
<br>
On 21/09/12 22:21, Victor Miller wrote:<br>
</div>
<blockquote
cite="mid:CAEe1e0xSxsQwqHARZVw=jNDX0dhiF1T29VQBg8=QiqvZ7Fbn1A@mail.gmail.com"
type="cite">
<meta http-equiv="Context-Type" content="text/html;
charset=ISO-8859-1">
I have a number of LP problems that I'm solving with Clp. In all
of them I have a fixed polytope, and given a point, x, I want to
find the closest (in L1) point in the polytope. I do this by
adding a bunch of variables y[i] to the original variables u[i] ,
and setting up the inequalities -x[i] <= y[i] - u[i], x[i]
<= y[i] + u[i]. I set up a new problem once, and then for
every point x I encounter I just change the lower bounds of the
appropriate inequalities and then resolve. For the most part this
works fine, except in one problem it seems to go into an infinite
loop, endlessly repeating a line like<br>
<br>
Clp0029I End of values pass after 497 iteration<br>
clp0006I 497 Obj 7.1249e+08 Primal inf 6.20756e+276 (330) Dual inf
5.25822e+17 (286) w.o. free dual inf (240)<br>
<br>
Is it somehow encountering an ill conditioned problem? How can I
track this down?<br>
<br>
<br>
Victor<br>
<br>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<br>
<pre wrap="">_______________________________________________
Clp mailing list
<a class="moz-txt-link-abbreviated" href="mailto:Clp@list.coin-or.org">Clp@list.coin-or.org</a>
<a class="moz-txt-link-freetext" href="http://list.coin-or.org/mailman/listinfo/clp">http://list.coin-or.org/mailman/listinfo/clp</a>
</pre>
</blockquote>
<br>
</body>
</html>