COIN-OR CLP

From Wikipedia, the free encyclopedia

The introduction to this article provides insufficient context for those unfamiliar with the subject matter.
Please help improve the introduction to meet Wikipedia's layout standards. You can discuss the issue on the talk page.

An editor has expressed a concern that the subject of the article does not satisfy the notability guideline or one of the following guidelines for inclusion on Wikipedia: Biographies, Books, Companies, Fiction, Music, Neologisms, Numbers, Web content, or several proposals for new guidelines.

If you are familiar with the subject matter, please expand the article to establish its notability. The best way to address this concern is to reference published, third-party sources about the subject. If notability cannot be established, the article is more likely to be considered for deletion, per Wikipedia:Guide to deletion. (See also Wikipedia:Notability)
This article has been tagged since October 2006.

This article or section does not adequately cite its references or sources.
Please help improve this article by adding citations to reliable sources. (help, get involved!)
This article has been tagged since October 2006.

CLP stands for COIN-OR LP . CLP is an open-source linear programming solver written in C++. It is published under the Common Public License so it can be used in commercial software without any of the contamination issues which GNU General Public License has. It is primarily meant to be used as a callable library, although a stand-alone executable version can be built. It is designed to be as reliable as any commercial solver (if not quite as fast) and to be able to tackle very large problems.

CLP is designed to solve problems such as :-

minimize $c_1 x_1 + c_2 x_2\,$

Problem constraints of the following form

$a_{11} x_1 + a_{12} x_2 \le b_1$

$a_{21} x_1 + a_{22} x_2 \le b_2$

$a_{31} x_1 + a_{32} x_2 \le b_3$

Non-negative variables

$x_1 \ge 0$

$x_2 \ge 0$

But with up to millions of variables and/or constraints. Its main algorithm is the Simplex algorithm.

COIN-OR was created in 2000 to allow different commercial and free solvers to share a common interface. COIN-OR now has more than 20 projects, but it soon became apparent that a native solver was needed by some of these projects and so CLP was coded. It is used in COIN-OR projects such as COIN-OR SYMPHONY, BCP (Branch Cut and Price), CBC (Coin Branch and Cut) and others.

COIN-OR CLP

From Wikipedia, the free encyclopedia

Views

Navigation

interaction

Search