Clp
1.17.6
|
![]() ![]() | Dual Row Pivot Dantzig Algorithm Class |
![]() ![]() | Dual Row Pivot Abstract Base Class |
![]() ![]() | Dual Row Pivot Steepest Edge Algorithm Class |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Primal Column Pivot Dantzig Algorithm Class |
![]() ![]() | Primal Column Pivot Abstract Base Class |
![]() ![]() | Primal Column Pivot Steepest Edge Algorithm Class |
![]() ![]() | |
![]() ![]() | This solves LPs using the dual simplex method |
![]() ![]() | This just implements AbcFactorization when an AbcMatrix object is passed |
![]() ![]() | This solves LPs using the primal simplex method |
![]() ![]() | |
![]() ![]() | As CoinWarmStartBasis but with alternatives (Also uses Clp status meaning for slacks) |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Very simple class for setting parameters |
![]() ![]() | Base class for Clp Cholesky factorization Will do better factorization |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Mumps class for Clp Cholesky factorization |
![]() ![]() | Taucs class for Clp Cholesky factorization |
![]() ![]() | Ufl class for Clp Cholesky factorization |
![]() ![]() | Wssmp class for Clp Cholesky factorization |
![]() ![]() | WssmpKKT class for Clp Cholesky factorization |
![]() ![]() | Constraint Abstract Base Class |
![]() ![]() | Linear Constraint Class |
![]() ![]() | Quadratic Constraint Class |
![]() ![]() | This is a tiny class where data can be saved round calls |
![]() ![]() | Base class for Clp disaster handling |
![]() ![]() | Dual Row Pivot Dantzig Algorithm Class |
![]() ![]() | Dual Row Pivot Abstract Base Class |
![]() ![]() | Dual Row Pivot Steepest Edge Algorithm Class |
![]() ![]() | This implements a dummy matrix as derived from ClpMatrixBase |
![]() ![]() | This implements a dynamic matrix when we have a limit on the number of "interesting rows" |
![]() ![]() | This implements a dynamic matrix when we have a limit on the number of "interesting rows" |
![]() ![]() | Base class for Clp event handling |
![]() ![]() | This just implements CoinFactorization when an ClpMatrixBase object is passed |
![]() ![]() | This implements Gub rows plus a ClpPackedMatrix |
![]() ![]() | This implements Gub rows plus a ClpPackedMatrix |
![]() ![]() | |
![]() ![]() | This solves LPs using interior point methods |
![]() ![]() | Linear Objective Class |
![]() ![]() | This class implements LSQR |
![]() ![]() | Abstract base class for Clp Matrices |
![]() ![]() | This deals with Clp messages (as against Osi messages etc) |
![]() ![]() | |
![]() ![]() | This deals with Factorization and Updates for network structures |
![]() ![]() | This implements a simple network matrix as derived from ClpMatrixBase |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | Objective Abstract Base Class |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This solves problems in Primal Dual Convex Optimization |
![]() ![]() | Abstract base class for tailoring everything for Pcdo |
![]() ![]() | |
![]() ![]() | Dual Row Pivot Steepest Edge Algorithm Class |
![]() ![]() | |
![]() ![]() | Primal Column Pivot Steepest Edge Algorithm Class |
![]() ![]() | BASE CLASS FOR THE IMPROVED SIMPLEX |
![]() ![]() | This implements a simple +- one matrix as derived from ClpMatrixBase |
![]() ![]() | This solves LPs using the predictor-corrector method due to Mehrotra |
![]() ![]() | This is the Clp interface to CoinPresolve |
![]() ![]() | Primal Column Pivot Dantzig Algorithm Class |
![]() ![]() | Primal Column Pivot Abstract Base Class |
![]() ![]() | Primal Column Pivot Steepest Edge Algorithm Class |
![]() ![]() | Primal Column Pivot Dantzig Algorithm Class |
![]() ![]() | Quadratic Objective Class |
![]() ![]() | This solves LPs using the simplex method |
![]() ![]() | This solves LPs using the dual simplex method |
![]() ![]() | This solves non-linear LPs using the primal simplex method |
![]() ![]() | This is for Simplex stuff which is neither dual nor primal |
![]() ![]() | This solves LPs using the primal simplex method |
![]() ![]() | For saving extra information to see if looping |
![]() ![]() | This is a very simple class to guide algorithms |
![]() ![]() | |
![]() ![]() | For a structure to be used by trusted code |
![]() ![]() | Abstract base class which also has some scalars so can be used from Dense or Simp |
![]() ![]() | This deals with Factorization and Updates This is a simple dense version so other people can write a better one |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This class implements a very silly algorithm |
![]() ![]() | For use internally |
![]() ![]() | ******** DATA to be moved into protected section of ClpInterior |
![]() ![]() | This is so user can trap events and do useful stuff |
![]() ![]() | |
![]() ![]() | This implements a simple network matrix as derived from ClpMatrixBase |
![]() ![]() | ******** DATA to be moved into protected section of ClpInterior |
![]() ![]() | |
![]() ![]() | Clp Solver Interface |
![]() ![]() | ******** DATA to be moved into protected section of ClpInterior |
![]() ![]() |