Changeset 954 for html


Ignore:
Timestamp:
Sep 1, 2004 4:26:17 PM (15 years ago)
Author:
ddelanu
Message:

Rewrote the FAQ in DocBook? to share source with the CLP User Guide. See comment in this document for more.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • html/trunk/Clp/faq.html

    r952 r954  
    5656      <td>
    5757        <div class="main-content">
    58         <p>
    59           <!-- <marquee>&quot;Coming Soon&quot;</marquee> -->
    60         </p>
    6158
    62               <p ALIGN=LEFT><b>Q: What is the <a href="../index.html">COIN-OR</a> LP code?</b><br>
    63                 A: The <a href="index.html">COIN LP</a> code is designed
    64                 to be a high quality Simplex code.
    65                 The first release was 0.90 and we are now up to 0.93.</p>
     59<!-- DO NOT CHANGE THIS FAQ by hand.  The content is automatically generated
     60     via DocBook.  The source is in COIN/Clp/Docs.  Read the DocBook for CLP
     61     document for more info.
     62-->
    6663
    67              
    68               <p><b>Q: Is it reliable?</b><br>
    69                 A: It has been tested on many problems of up to
    70                 1.5 million constraints and has shown itself as
    71                 reliable as OSL.  It is also being tested in the
    72                 context of SBB, but more testing is needed before
    73                 it can get to version 1.0.</p>
     64<div class="qandaset"><dl><dt>Q: <a href="index.html#id4693599">
     65  What is CLP?
     66  </a></dt><dt>Q: <a href="index.html#id4695256">
     67  What are some of the features of CLP?
     68  </a></dt><dt>Q: <a href="index.html#id4695282">
     69  The barrier method sounds interesting, what are some of the details?
     70  </a></dt><dt>Q: <a href="index.html#id4695308">
     71  How do I obtain and install CLP?
     72  </a></dt><dt>Q: <a href="index.html#id4695346">
     73  Is CLP reliable?
     74  </a></dt><dt>Q: <a href="index.html#id4694232">
     75  On which platforms does CLP run?   
     76  </a></dt><dt>Q: <a href="index.html#id4694283">
     77  Is there any documentation for CLP? 
     78  </a></dt><dt>Q: <a href="index.html#id4694316">
     79  Is CLP as fast as OSL?
     80  </a></dt><dt>Q: <a href="index.html#id4694337">
     81  When will version 1.0 of CLP be available? 
     82  </a></dt><dt>Q: <a href="index.html#id4757333">
     83  What can the community do to help?
     84  </a></dt></dl><table border="0" summary="Q and A Set"><col align="left" width="1%"><tbody><tr class="question"><td align="left" valign="top"><a name="id4693599"></a><a name="id4693601"></a><b>Q:</b></td><td align="left" valign="top"><p>
     85  What is <a href="http://www.coin-or.org/Clp/" target="_top">CLP</a>?
     86  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     87  (DN 08/27/04) The <a href="http://www.coin-or.org/" target="_top">COIN-OR</a> LP code
     88  is designed to be a high quality Simplex code provided under the terms of the
     89  <a href="http://opensource.org/licenses/cpl.php" target="_top">Common Public License</a>.
     90  CLP is written in C++, and is primarily intended to be used as a callable
     91  library (though a rudimentary stand-alone executable exists).
     92  The first release was version .90.  The current release is version .99.8.
     93  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4695256"></a><a name="id4695258"></a><b>Q:</b></td><td align="left" valign="top"><p>
     94  What are some of the features of CLP?
     95  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     96  (DN 08/27/04) CLP includes primal and dual Simplex solvers.  Both dual and primal algorithms
     97  can use matrix storage methods provided by the user (0-1 and network matrices
     98  already supported in addition the default sparse matrix). The dual algorithm
     99  has Dantzig and Steepest edge row pivot choices and new ones may be provided by
     100  the user. The same is true for the column pivot choice of the primal algorithm.
     101  The primal can also use a non linear cost which should work for piecewise
     102  linear convex functions.  CLP also includes a barrier method for solving LPs.
     103  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4695282"></a><a name="id4695285"></a><b>Q:</b></td><td align="left" valign="top"><p>
     104  The barrier method sounds interesting, what are some of the details?
     105  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     106  (DN 08/30/04) The CLP barrier method solves convex QPs as well as LPs. In
     107  general, a barrier method requires implementation of the algorithm, as
     108  well as a fast Cholesky factorization.  CLP provides the algorithm, and is
     109  expected to have a reasonable factorization implementation by the release of
     110  CLP version 1.0.  However, the sparse factorization requires a good ordering
     111  algorithm, which the user is expected to provide the ordering code, and
     112  perhaps a better factorization code as well.
     113  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4695308"></a><a name="id4695311"></a><b>Q:</b></td><td align="left" valign="top"><p>
     114  How do I obtain and install CLP?
     115  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     116  (DN 08/27/04) Please see the
     117  <a href="http://www.coin-or.org/faqs.html/" target="_top">COIN-OR FAQ</a>
     118  for details on how to
     119  <a href="http://www.coin-or.org/faqs.html/#ObtainSrcCode" target="_top">obtain</a>
     120  and
     121  <a href="http://www.coin-or.org/faqs.html/#BuildCode" target="_top">install</a>
     122  COIN-OR modules.
     123  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4695346"></a><a name="id4695348"></a><b>Q:</b></td><td align="left" valign="top"><p>
     124  Is CLP reliable?
     125  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     126  (DN 08/27/04) CLP has been tested on many problems of up to 1.5 million constraints and has
     127  shown itself as reliable as OSL. It is also being tested in the context of
     128  <a href="http://www.coin-or.org/faqs.html#SBB" target="_top">SBB</a>, but more testing
     129  is needed before it can get to version 1.0.
     130  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4694232"></a><a name="id4694234"></a><b>Q:</b></td><td align="left" valign="top"><p>
     131  On which platforms does CLP run?   
     132  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     133  (DN 08/27/04) CLP compiles and has been tested (to varying degrees) on the following
     134  platforms:
     135  </p><div class="itemizedlist"><ul type="disc"><li><p>
     136  Linux using g++ version 3.1.1 (or later).
     137  </p></li><li><p>
     138  Windows using Microsoft Visual C++ 6
     139  </p></li><li><p>
     140  Windows using cygwin
     141  </p></li><li><p>
     142  AIX using xIC (not supported in the current Makefile)
     143  </p></li></ul></div></td></tr><tr class="question"><td align="left" valign="top"><a name="id4694283"></a><a name="id4694285"></a><b>Q:</b></td><td align="left" valign="top"><p>
     144  Is there any documentation for CLP? 
     145  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     146  (DN 08/27/04) A User Guide should be available in time for the release of version 1.0 of CLP.
     147  Also available is a list of
     148  <a href="http://www.coin-or.org/Doxygen/Clp/" target="_top">CLP class descriptions</a>.
     149  More on CLP documentation is available on the
     150  <a href="http://www.coin-or.org/Clp/documentation.html" target="_top">CLP documentation webpage</a>.
     151  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4694316"></a><a name="id4694318"></a><b>Q:</b></td><td align="left" valign="top"><p>
     152  Is CLP as fast as OSL?
     153  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     154   (DN 08/27/04) It uses sparse techniques designed for very large problems. The design
     155   criteria were for it not to be too slow. Some speed has been sacrificed
     156   to make the code less opaque than OSL (not difficult!).
     157  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4694337"></a><a name="id4694339"></a><b>Q:</b></td><td align="left" valign="top"><p>
     158  When will version 1.0 of CLP be available? 
     159  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     160  (DN 08/27/04) It is expected that version 1.0 will be released in time for the 2004
     161  <a href="http://www.informs.org" target="_top">INFORMS</a>
     162  <a href="http://www.informs.org/Conf/Denver2004/" target="_top">Annual Meeting</a>
     163  (24-27 October, 2004).
     164  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757333"></a><a name="id4757335"></a><b>Q:</b></td><td align="left" valign="top"><p>
     165  What can the community do to help?
     166  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     167  (DN 08/27/04) A lot!  A good first step would be to join the CLP
     168  <a href="http://www.coin-or.org/mail.html" target="_top">mailing lists</a>.  Some
     169  other possibilities:
     170  </p><div class="itemizedlist"><ul type="disc"><li><p>
     171  Comment on the design
     172  </p></li><li><p>
     173  Break the code, or better yet, mend it.
     174  </p></li><li><p>
     175  Add non-English language support in your own favo(u)rite language.
     176  </p></li><li><p>
     177  Improve the Clp executable
     178  </p></li><li><p>
     179  Etc.
     180  </p></li></ul></div></td></tr></tbody></table></div>
    74181
    75 
    76               <p><b>Q: Is it as fast as OSL?</b><br>
    77                 A: It uses sparse techniques designed for very
    78                 large problems.  The design criteria where for it
    79                 not to be too slow.  Some speed has been
    80                 sacrificed to make the code less opaque than
    81                 OSL (not difficult:-)).</p>
    82 
    83 
    84               <p><b>Q: When will version 1.0 be available?</b><br>
    85                 A: It depends on the interest of the COIN audience and
    86                 on the workload of John Forrest.  It was meant to be
    87                 a community effort, but rather more was done before
    88                 the prototype was released than had been intended.
    89                 It now has a presolve, but it still needs more
    90                 done to it.</p>
    91 
    92 
    93               <p><b>Q: What are a few of its features?</b><br>
    94                 A: Both dual and primal algorithms can use matrix
    95                 storage methods provided by user e.g. all 1.0.  At
    96                 present just OsiPackedMatrix is supported.  The Dual
    97                 algorithm has Dantzig and Steepest edge row pivot choices
    98                 and new ones may be provided by user.  Similarly for
    99                 the column pivot choice in Primal.  Primal also
    100                 uses a non linear cost.  This should work for
    101                 piecewise linear convex functions and I will try
    102                 to get it to work for non-convex functions.</p>
    103 
    104 
    105               <p><b>Q: What can the community do to help?</b><br>
    106                 A: Lots.</p>
    107               <ul>
    108                 <li>Comment on the design.  I have not invested
    109                 so much time that it will hurt too much to totally
    110                 redesign it.</li>
    111                 <li>Break the code - even better - mend the code.  </li>
    112                 <li>Add national language support in your own favo(u)rite language.</li>
    113                 <li>Improve the driver in Clp to give more help etc</li>
    114               </ul>
    115 
    116 
    117               <p><b>Q: Is there any documentation for CLP?</b><br>
    118                 A: Not much yet. For the user, there are very few
    119                 knobs to twiddle anyway.  Just execute clp
    120                 in the Clp directory and follow instructions.</p>
    121 
    122 
    123               <p><b>Q: What platforms does CLP run on?</b><br>
    124                 A: CLP has been tested on:</p>
    125               <ul>
    126                 <li>Linux using g++ V3.1.1.</li>
    127                 <li>Windows using Microsoft Visual C++ V6</li>
    128                 <li>AIX using xlC (not supported by current Makefile).</li>
    129               </ul>
    130 
    131 
    132 
    133         <p>
    134           <!-- <a href="../faqs.html#CLP">General CLP FAQ</a> -->
    135         </p>
    136182        </div>
    137183        <!--        -->
Note: See TracChangeset for help on using the changeset viewer.