<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta content="text/html;charset=ISO-8859-1" http-equiv="Content-Type">
<title></title>
</head>
<body bgcolor="#ffffff" text="#000000">
<tt>Peter,<br>
<br>
I am fwd'ing this to coin-discuss. Folks, this is a BCP question, but
bcp-discuss is fairly inactive, so I am using coin-discuss - it relates
to the use of my example of doing branch and price with BCP found here:
<a class="moz-txt-link-freetext" href="http://coral.ie.lehigh.edu/~coin/COIN_EXAMPLES/AAP_BP/Doc/aap/index.html">http://coral.ie.lehigh.edu/~coin/COIN_EXAMPLES/AAP_BP/Doc/aap/index.html</a><br>
<br>
Peter, I would say that in general, "no" CLP is not as "efficient" as
CPX - but it is competitive. What you are seeing has nothing to do with
the efficiency of the LP solve. It has to do with the way that BCP
works with different LP solvers - perhaps the issue is in the OSI layer
- sometimes, the OSI layer can get out of sync as solver
implementations change. I have not used BCP in a long time - when I
did, I mainly worked with CLP - so I can't say too much about whether
or not CPX will work with it. Hopefully someone on the list can share
their experience using BCP + CPX. <br>
<br>
If no one gets around to helping you, I will have a look sometime
later. Too busy at the moment.<br>
<br>
Thanks,<br>
Matt<br>
<br>
</tt>
<pre class="moz-signature" cols="72"><tt>--
Matthew Galati - Optimization Developer
SAS Institute - Analytical Solutions
Phone 919-531-0332, R5327
Fax 919-677-4444
<a class="moz-txt-link-freetext" href="http://coral.ie.lehigh.edu/~magh">http://coral.ie.lehigh.edu/~magh</a>
<a class="moz-txt-link-freetext" href="http://ordlnx2.na.sas.com/projects/OptWiki">http://ordlnx2.na.sas.com/projects/OptWiki</a>
<a class="moz-txt-link-freetext" href="http://www.sas.com/technologies/analytics/optimization/">http://www.sas.com/technologies/analytics/optimization/</a></tt></pre>
<tt><br>
</tt><br>
-------- Original Message --------
<table border="0" cellpadding="0" cellspacing="0">
<tbody>
<tr>
<th align="right" nowrap="nowrap" valign="baseline">Subject: </th>
<td>RE: need updated files</td>
</tr>
<tr>
<th align="right" nowrap="nowrap" valign="baseline">Date: </th>
<td>Sat, 23 Apr 2005 16:34:20 -0500</td>
</tr>
<tr>
<th align="right" nowrap="nowrap" valign="baseline">From: </th>
<td>Heesu Hwang <a class="moz-txt-link-rfc2396E" href="mailto:hxh9528@exchange.uta.edu"><hxh9528@exchange.uta.edu></a></td>
</tr>
<tr>
<th align="right" nowrap="nowrap" valign="baseline">To: </th>
<td>Matthew Galati <a class="moz-txt-link-rfc2396E" href="mailto:magh@lehigh.edu"><magh@lehigh.edu></a></td>
</tr>
</tbody>
</table>
<br>
<br>
<title></title>
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
<meta content="MSHTML 6.00.2900.2627" name="GENERATOR">
<div><span class="812422321-23042005"></span><font face="굴림"><font
color="#0000ff"><font size="2"><span class="812422321-23042005">Sorry
for bugging you with short knowledge on Unix, compilations, and so on.</span></font></font></font></div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005">However, I have interesting results...</span></font></font></font></div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005"></span></font></font></font> </div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005">I tested CLP and CPX with your small/6.1.aap</span></font></font></font></div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005">and got following results.</span></font></font></font></div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005"></span></font></font></font> </div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005">Can I say CLP is more efficient than CPX
for your problem instance?</span></font></font></font></div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005">I just want to make it sure that both will
give same solutions.</span></font></font></font></div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005"></span></font></font></font> </div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005">Thanks,</span></font></font></font></div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005"></span></font></font></font> </div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005">Peter.</span></font></font></font></div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005"></span></font></font></font> </div>
<div><font face="굴림"><font color="#0000ff"><font size="2"><span
class="812422321-23042005">##############</span>C<span
class="812422321-23042005">LP results######################</span></font></font></font></div>
<div><font color="#0000ff" face="굴림" size="2"><span
class="812422321-23042005"></span><br>
Clp0006I 4 Obj 48.6667<br>
Clp0000I Optimal - objective value 48.6667<br>
LP: Matrix size: 53 vars x 7 cuts<br>
LP: Solution value: 48.6667 / 2 , 4<br>
LP: Default test_feasibility() executed.<br>
LP: Default test_full() executed.<br>
Clp0006I 0 Obj -100000 Primal inf 8 (8)<br>
Clp0006I 12 Obj -99954<br>
Clp0000I Optimal - objective value -99954<br>
LP: Terminating and fathoming due to proven high cost.<br>
TM: Running time: 0.550<br>
TM: search tree size: 15 max depth: 5<br>
LP statistics:<br>
time in cut generation : 0.000 sec<br>
time in var generation : 0.000 sec<br>
time in heuristics : 0.000 sec<br>
time in solving LPs : 0.270 sec<br>
time in strong branching: 0.060 sec</font></div>
<div><font color="#0000ff" face="굴림" size="2"></font> </div>
<div><font color="#0000ff" face="굴림" size="2">TM: The best solution
found has value 46.000000<br>
TM: Default BCP_tm_user::display_feasible_solution() executed.<br>
Algo var (internal index: -135 ) at 1.0000<br>
</font></div>
<div><font color="#0000ff" face="굴림" size="2"></font> </div>
<div><span class="812422321-23042005"></span><font face="굴림"><font
color="#0000ff"><font size="2">#<span class="812422321-23042005">####################CPX
results#########################</span></font></font></font><br>
<font color="#0000ff" face="굴림" size="2">LP: *** Starting iteration
29926 ***<br>
LP node written in file sampleAAP.mps<br>
LP: Matrix size: 29966 vars x 7 cuts<br>
LP: Solution value: 125.6000 / 4 , 0<br>
LP: Default test_feasibility() executed.<br>
LP: Default test_full() executed.<br>
LP: Primal feasibility lost.<br>
LP: Generating columns before fathoming/resolving<br>
TM: Time has ran out.<br>
TM: Best lower bound in this phase: 39.333333<br>
TM: Running time: 4509.420<br>
TM: search tree size: 9 max depth: 4<br>
LP statistics:<br>
time in cut generation : 0.000 sec<br>
time in var generation : 0.000 sec<br>
time in heuristics : 0.000 sec<br>
time in solving LPs : 3915.640 sec<br>
time in strong branching: 0.030 sec</font></div>
<div><font color="#0000ff" face="굴림" size="2"></font> </div>
<div><font color="#0000ff" face="굴림" size="2">TM: The best solution
found has value 52.000000<br>
TM: Default BCP_tm_user::display_feasible_solution() executed.<br>
Algo var (internal index: -73 ) at 1.0000<br>
</font></div>
<div><font color="#0000ff" face="굴림" size="2"></font> </div>
<blockquote style="margin-right: 0px;" dir="ltr"> </blockquote>
<br>
<pre class="moz-signature" cols="72">
</pre>
</body>
</html>