Changeset 2413


Ignore:
Timestamp:
Mar 6, 2019 7:20:51 PM (8 months ago)
Author:
stefan
Message:

cleanup faq a bit

File:
1 edited

Legend:

Unmodified
Added
Removed
  • branches/gh-pages/faq.md

    r2410 r2413  
    22===
    33
    4 **Q:** What is [CLP](http://www.coin-or.org/Clp/)?
     4**Q:** What is [CLP](http://www.github.com/coin-or/Clp/)?
    55
    66**A:** (DN 08/27/04) The [COIN-OR](http://www.coin-or.org/) LP code is
    77designed to be a high quality Simplex code provided under the terms of
    8 the [Eclipse Public
    9 License](http://www.opensource.org/licenses/eclipse-1.0.php). CLP is
     8the [Eclipse Public License](http://www.opensource.org/licenses/eclipse-1.0.php). CLP is
    109written in C++, and is primarily intended to be used as a callable
    1110library (though a rudimentary stand-alone executable exists). The first
     
    2524**Q:** How do I obtain and install CLP?
    2625
    27 **A:** (DN 08/27/04) Please see the [COIN-OR
    28 FAQ](http://www.coin-or.org/faqs.html) for details on how to
     26**A:** (DN 08/27/04) Please see the [COIN-OR FAQ](http://www.coin-or.org/faqs.html) for details on how to
    2927[obtain](http://www.coin-or.org/faqs.html#ObtainSrcCode) and
    3028[install](http://www.coin-or.org/faqs.html#BuildCode) COIN-OR modules.
     
    3533million constraints and has shown itself as reliable as OSL. It is also
    3634being tested in the context of developing
    37 [CBC](http://www.coin-or.org/faqs.html#CBC) (\"Coin Branch and Cut\",
     35[CBC](http://www.coin-or.org/faqs.html#CBC) ("Coin Branch and Cut",
    3836which is used to solve integer programs); it is now considered reliable
    3937enough to be at version 1.0.
     
    5553
    5654**A:** (DN 09/16/04) An early release of a User Guide is available on
    57 the [CLP documentation
    58 webpage](http://www.coin-or.org/Clp/documentation.html). Also available
    59 is a list of [CLP class
    60 descriptions](http://www.coin-or.org/Doxygen/Clp/) generated by
     55the [CLP user's guide page](https://coin-or.github.io/Clp). Also available
     56is a list of [CLP class descriptions](http://www.coin-or.org/Doxygen/Clp/) generated by
    6157[Doxygen](http://www.doxygen.org).
    6258
     
    7167
    7268**A:** (DN 08/27/04) Version 1.0 was released in time for the 2004
    73 [INFORMS](http://www.informs.org) [Annual
    74 Meeting](http://www.informs.org/Conf/Denver2004/) (24-27 October, 2004).
     69[INFORMS](http://www.informs.org) [Annual Meeting](http://www.informs.org/Conf/Denver2004/) (24-27 October, 2004).
    7570
    7671**Q:** The barrier method sounds interesting, what are some of the
     
    8580expected to provide (perhaps a better factorization code as well).
    8681
    87 **Q:** Which Cholesky factorizations codes are supported by CLP\'s
     82**Q:** Which Cholesky factorizations codes are supported by CLP's
    8883barrier method?
    8984
     
    9287Interfaces are provided to each of the following:
    9388
    94 -   Anshul Gupta\'s WSSMP parallel enabled ordering and factorization
     89-   Anshul Gupta's WSSMP parallel enabled ordering and factorization
    9590    code
    9691
    97 -   Sivan Toledo\'s TAUCS parallel enabled factorization code (the
     92-   Sivan Toledo's TAUCS parallel enabled factorization code (the
    9893    package includes third party ordering codes)
    9994
    100 -   University of Florida\'s Approximate Minimum Degree (AMD) ordering
     95-   University of Florida's Approximate Minimum Degree (AMD) ordering
    10196    code (the CLP native factorization code is used with this ordering
    10297    code)
     
    119114for more than a year and and the principal author, John Forrest, knows
    120115more about simplex algorithms than interior point algorithms, so the
    121 answer is \"no\". However, it performs well on test sets and seems to be
     116answer is "no". However, it performs well on test sets and seems to be
    122117more reliable than some commercially available codes (including OSL).
    123118
     
    131126used. One may wish to switch off the crossover to a basic feasible
    132127solution as the simplex code can be slow. The sequential linear code is
    133 useful as a \"crash\" to the simplex code; its convergence is poor but,
     128useful as a "crash" to the simplex code; its convergence is poor but,
    134129say, 100 iterations could set up the problem well for the simplex code.
    135130
     
    147142
    148143-   Improve the CLP executable. In particular it would be nice to be
    149     able to link the executable\'s online help system with the existing
     144    able to link the executable's online help system with the existing
    150145    CLP Samples (e.g. entering `presol???` would give the user
    151146    references to all CLP Sample files which use presolve).
Note: See TracChangeset for help on using the changeset viewer.