Changeset 962 for html


Ignore:
Timestamp:
Sep 16, 2004 5:10:24 PM (15 years ago)
Author:
ddelanu
Message:

Fixed some more typos and made clear the actual existence of a User Guide

File:
1 edited

Legend:

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

    r961 r962  
    6565<!-- Begin DocBook content here -->
    6666<!--                            -->
    67 <div class="qandaset"><dl><dt>Q: <a href="#id4693599">
     67<div class="qandaset"><dl><dt>Q: <a href="index.html#id4693599">
    6868  What is CLP?
    69   </a></dt><dt>Q: <a href="#id4694311">
     69  </a></dt><dt>Q: <a href="index.html#id4694311">
    7070  What are some of the features of CLP?
    71   </a></dt><dt>Q: <a href="#id4694338">
     71  </a></dt><dt>Q: <a href="index.html#id4694338">
    7272  How do I obtain and install CLP?
    73   </a></dt><dt>Q: <a href="#id4695264">
     73  </a></dt><dt>Q: <a href="index.html#id4695264">
    7474  Is CLP reliable?
    75   </a></dt><dt>Q: <a href="#id4695295">
     75  </a></dt><dt>Q: <a href="index.html#id4695295">
    7676  On which platforms does CLP run?   
    77   </a></dt><dt>Q: <a href="#id4695346">
     77  </a></dt><dt>Q: <a href="index.html#id4695346">
    7878  Is there any documentation for CLP? 
    79   </a></dt><dt>Q: <a href="#id4757338">
     79  </a></dt><dt>Q: <a href="index.html#id4757343">
    8080  Is CLP as fast as OSL?
    81   </a></dt><dt>Q: <a href="#id4757359">
     81  </a></dt><dt>Q: <a href="index.html#id4757364">
    8282  When will version 1.0 of CLP be available? 
    83   </a></dt><dt>Q: <a href="#id4757390">
     83  </a></dt><dt>Q: <a href="index.html#id4757396">
    8484  The barrier method sounds interesting, what are some of the details?
    85   </a></dt><dt>Q: <a href="#id4757416">
    86   Which Cholesky factorizations codes are supported?
    87   </a></dt><dt>Q: <a href="#id4757480">
     85  </a></dt><dt>Q: <a href="index.html#id4757421">
     86  Which Cholesky factorizations codes are supported by CLP's barrier method?
     87  </a></dt><dt>Q: <a href="index.html#id4757485">
    8888  When will CLP have a good native ordering?
    89   </a></dt><dt>Q: <a href="#id4757501">
    90   Is the interior point code as mature as the simplex code?
    91   </a></dt><dt>Q: <a href="#id4757525">
     89  </a></dt><dt>Q: <a href="index.html#id4757506">
     90  Is the barrier code as mature as the simplex code?
     91  </a></dt><dt>Q: <a href="index.html#id4757531">
    9292  Which algorithm should I use for quadratic programming and should I keep an
    9393  eye open for any issues?
    94   </a></dt><dt>Q: <a href="#id4757558">
     94  </a></dt><dt>Q: <a href="index.html#id4757563">
    9595  What can the community do to help?
    9696  </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>
     
    108108  (DN 08/27/04) CLP includes primal and dual Simplex solvers.  Both dual and primal algorithms
    109109  can use matrix storage methods provided by the user (0-1 and network matrices
    110   are already supported in addition the default sparse matrix). The dual algorithm
     110  are already supported in addition to the default sparse matrix). The dual algorithm
    111111  has Dantzig and Steepest edge row pivot choices; new ones may be provided by
    112112  the user. The same is true for the column pivot choice of the primal algorithm.
     
    131131  <a href="http://www.coin-or.org/faqs.html#SBB" target="_top">SBB</a>
    132132  ("Simple Branch and Bound", which is used to solve integer
    133   programs, but more testing is needed before it can get to version 1.0.
     133  programs), but more testing is needed before it can get to version 1.0.
    134134  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4695295"></a><a name="id4695297"></a><b>Q:</b></td><td align="left" valign="top"><p>
    135135  On which platforms does CLP run?   
     
    138138  platforms:
    139139  </p><div class="itemizedlist"><ul type="disc"><li><p>
    140   Linux using g++ version 3.1.1 (or later).
     140  Linux using g++ version 3.1.1 (or later)
    141141  </p></li><li><p>
    142142  Windows using Microsoft Visual C++ 6
     
    148148  Is there any documentation for CLP? 
    149149  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
    150   (DN 08/27/04) A User Guide should be available in time for the release of version 1.0 of CLP.
     150  (DN 09/16/04) An early release of a User Guide is available on the
     151  <a href="http://www.coin-or.org/Clp/documentation.html" target="_top">CLP documentation webpage</a>.
    151152  Also available is a list of
    152   <a href="http://www.coin-or.org/Doxygen/Clp/" target="_top">CLP class descriptions</a>.
    153   More on CLP documentation is available on the
    154   <a href="http://www.coin-or.org/Clp/documentation.html" target="_top">CLP documentation webpage</a>.
    155   </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757338"></a><a name="id4757340"></a><b>Q:</b></td><td align="left" valign="top"><p>
     153  <a href="http://www.coin-or.org/Doxygen/Clp/" target="_top">CLP class descriptions</a> generated
     154  by <a href="http://www.doxygen.org" target="_top">Doxygen</a>.
     155  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757343"></a><a name="id4757346"></a><b>Q:</b></td><td align="left" valign="top"><p>
    156156  Is CLP as fast as OSL?
    157157  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
    158    (DN 08/27/04) It uses sparse matrix techniques designed for very large
     158   (DN 08/27/04) CLP uses sparse matrix techniques designed for very large
    159159   problems. The design criteria were for it not to be too slow. Some speed
    160    has been sacrificed to make the code less opaque than OSL (not
    161    difficult!).
    162   </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757359"></a><a name="id4757361"></a><b>Q:</b></td><td align="left" valign="top"><p>
     160   has been sacrificed to make the code less opaque OSL (not difficult!).
     161  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757364"></a><a name="id4757366"></a><b>Q:</b></td><td align="left" valign="top"><p>
    163162  When will version 1.0 of CLP be available? 
    164163  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     
    167166  <a href="http://www.informs.org/Conf/Denver2004/" target="_top">Annual Meeting</a>
    168167  (24-27 October, 2004).
    169   </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757390"></a><a name="id4757393"></a><b>Q:</b></td><td align="left" valign="top"><p>
     168  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757396"></a><a name="id4757398"></a><b>Q:</b></td><td align="left" valign="top"><p>
    170169  The barrier method sounds interesting, what are some of the details?
    171170  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     
    177176  algorithm, which the user is expected to provide (perhaps a better
    178177  factorization code as well).
    179   </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757416"></a><a name="id4757418"></a><b>Q:</b></td><td align="left" valign="top"><p>
    180   Which Cholesky factorizations codes are supported?
    181   </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
    182   (DN 09/16/04) The Cholesky interface is flexible enough so that any of a variety of Cholesky
     178  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757421"></a><a name="id4757423"></a><b>Q:</b></td><td align="left" valign="top"><p>
     179  Which Cholesky factorizations codes are supported by CLP's barrier method?
     180  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     181  (DN 09/16/04) The Cholesky interface is flexible enough so that a variety of Cholesky
    183182  ordering and factorization codes can be used.  Interfaces are provided to each
    184183  of the following:
     
    189188  third party ordering codes)
    190189  </p></li><li><p>
    191   University of Florida's Approximate Minimum Degree ordering code (AMD) (the
     190  University of Florida's Approximate Minimum Degree (AMD) ordering code (the
    192191  CLP native factorization code is used with this ordering code)
    193192  </p></li><li><p>
     
    196195  Fast dense factorization
    197196  </p></li></ul></div><p>
    198   </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757480"></a><a name="id4757482"></a><b>Q:</b></td><td align="left" valign="top"><p>
     197  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757485"></a><a name="id4757487"></a><b>Q:</b></td><td align="left" valign="top"><p>
    199198  When will CLP have a good native ordering?
    200199  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
     
    202201  of the COIN distribution under the CPL.  However, if this is not possible, the
    203202  native ordering will be made respectable.
    204   </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757501"></a><a name="id4757503"></a><b>Q:</b></td><td align="left" valign="top"><p>
    205   Is the interior point code as mature as the simplex code?
     203  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757506"></a><a name="id4757508"></a><b>Q:</b></td><td align="left" valign="top"><p>
     204  Is the barrier code as mature as the simplex code?
    206205  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
    207206  (DN 09/16/04) The simplex code has been exposed to user testing for more than a year and
     
    210209  performs well on test sets and seems to be more reliable than some
    211210  commercially available codes (including OSL).
    212   </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757525"></a><a name="id4757528"></a><b>Q:</b></td><td align="left" valign="top"><p>
     211  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757531"></a><a name="id4757533"></a><b>Q:</b></td><td align="left" valign="top"><p>
    213212  Which algorithm should I use for quadratic programming and should I keep an
    214213  eye open for any issues?
     
    222221  convergence is poor but, say, 100 iterations could set up the problem well for
    223222  the simplex code.
    224   </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757558"></a><a name="id4757560"></a><b>Q:</b></td><td align="left" valign="top"><p>
     223  </p></td></tr><tr class="question"><td align="left" valign="top"><a name="id4757563"></a><a name="id4757565"></a><b>Q:</b></td><td align="left" valign="top"><p>
    225224  What can the community do to help?
    226225  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:</b></td><td align="left" valign="top"><p>
Note: See TracChangeset for help on using the changeset viewer.