<br><font size=2 face="sans-serif">Gjelsvik,</font>
<br>
<br><font size=2 face="sans-serif">You probably won't gain very much by
saving the factorization but anyway all you need to do is use</font>
<br><font size=2 face="sans-serif"> dual(0,3);</font>
<br>
<br><font size=2 face="sans-serif">The 3 for startFinishOptions says to
save factorization and re-use if number of rows and columns does not change.</font>
<br>
<br><font size=2 face="sans-serif">The status and solution will automatically
be saved.</font>
<br>
<br><font size=2 face="sans-serif">John Forrest</font>
<br>
<br>
<br>
<table width=100%>
<tr valign=top>
<td width=40%><font size=1 face="sans-serif"><b>"Gjelsvik Anders"
<Anders.Gjelsvik@sintef.no></b> </font>
<br><font size=1 face="sans-serif">Sent by: coin-lpsolver-bounces@list.coin-or.org</font>
<p><font size=1 face="sans-serif">02/21/2005 08:52 AM</font>
<td width=59%>
<table width=100%>
<tr>
<td>
<div align=right><font size=1 face="sans-serif">To</font></div>
<td valign=top><font size=1 face="sans-serif"><coin-lpsolver@list.coin-or.org></font>
<tr>
<td>
<div align=right><font size=1 face="sans-serif">cc</font></div>
<td valign=top>
<tr>
<td>
<div align=right><font size=1 face="sans-serif">Subject</font></div>
<td valign=top><font size=1 face="sans-serif">[Coin-lpsolver] Coin-lpsolver,
basis factorization</font></table>
<br>
<table>
<tr valign=top>
<td>
<td></table>
<br></table>
<br>
<br>
<br><font size=2 face="Arial">Hi,</font>
<br><font size=3> </font>
<br><font size=2 face="Arial">I am new to Coin-Clp. I am considering Coin-Clp
for a case where many almost similar LP problems are to be solved.</font>
<br><font size=2 face="Arial">Here time can be saved by using the final
basis from one problem as an initial basis for the next. In most</font>
<br><font size=2 face="Arial">cases, only the RHS differs, so the problem
is suitable for a dual algorithm.</font>
<br><font size=3> </font>
<br><font size=2 face="Arial">I believe it is quite straightforward to
have Clp start from a given basis, one could say, from logical basis information.</font>
<br><font size=3> </font>
<br><font size=2 face="Arial">My question is: Can the numerical basis
matrix factors be preserved between successive calls, or will it be necessary</font>
<br><font size=2 face="Arial">to carry out the numerical factorization
anew for each model solved? I would be grateful if somebody could answer.</font>
<br><font size=3> </font>
<br><font size=2 face="Arial">Thanks in advance,</font>
<br><font size=2 face="Arial">Anders</font>
<br><font size=2 face="Arial">_________________________________</font>
<br><font size=2 face="Arial">Anders Gjelsvik</font>
<br><font size=2 face="Arial">Sintef Energy Research</font>
<br><font size=2 face="Arial">7465 Trondheim, Norway</font>
<br><font size=2 face="Arial">e-mail </font><a href=mailto:anders.gjelsvik@sintef.no><font size=2 color=blue face="Arial"><u>anders.gjelsvik@sintef.no</u></font></a><font size=2><tt>_______________________________________________<br>
Coin-lpsolver mailing list<br>
Coin-lpsolver@list.coin-or.org<br>
http://list.coin-or.org/mailman/listinfo/coin-lpsolver<br>
</tt></font>
<br>