Functions — github.com/coin-or/Clp

CodeHub MCPcopy Create free account

hub / github.com/coin-or/Clp / functions

Functions3,454 in github.com/coin-or/Clp

⨍ Functions 3,454◇ Types & classes 257

↓ 2 callersFunctiondowork

src/ClpMain.cpp:377

↓ 2 callersFunctiondowork

src/Attic/ClpMain.cpp:327

↓ 2 callersFunctiondtrsm0

src/AbcSimplexParallel.cpp:1948

↓ 2 callersFunctiondtrsm1

src/AbcSimplexParallel.cpp:2063

↓ 2 callersFunctiondtrsm2

src/AbcSimplexParallel.cpp:2171

↓ 2 callersFunctiondtrsm3

src/AbcSimplexParallel.cpp:2268

↓ 2 callersFunctiondualColumnSolution

src/ClpModel.hpp:545

↓ 2 callersFunctiondualRowSolution

Dual row solution

src/ClpModel.hpp:536

↓ 2 callersMethodearlyFactorization

Early factorization

src/AbcSimplex.hpp:207

↓ 2 callersMethodenableFactorization

Force scaling off. If the client thinks we're maximising, arrange it so that clp sees minimisation while the client still sees maximisation. In ke

src/OsiClp/OsiClpSolverInterface.cpp:6983

↓ 2 callersFunctionequalDouble

Seems to be something odd about exact comparison of doubles on linux

src/ClpSolve.cpp:4424

↓ 2 callersMethodfactorizePart2

Factorize - filling in rowsDropped and returning number dropped in integerParam. */

src/ClpCholeskyBase.cpp:3349

↓ 2 callersMethodfathomed

Return true if branch exhausted

src/ClpNode.cpp:659

↓ 2 callersMethodfinish

src/ClpSimplex.cpp:9685

↓ 2 callersMethodfinishSolve

src/AbcSimplexDual.cpp:298

↓ 2 callersFunctionfirstPass

src/AbcMatrix.cpp:1168

↓ 2 callersFunctionfmtTime

src/ClpOutput.cpp:241

↓ 2 callersMethodgenerateCpp

Create C++ lines to get to current state

src/ClpModel.cpp:5289

↓ 2 callersMethodgenerateCpp

Create C++ lines to get to current state

src/OsiClp/OsiClpSolverInterface.cpp:11093

↓ 2 callersMethodgetAvailableArrayPublic

Returns first available empty array (and sets flag) when no possibility of going parallel */

src/AbcSimplex.hpp:882

↓ 2 callersFunctiongetCoinErrorField

src/CbcOrClpParam.cpp:1512

↓ 2 callersFunctiongetColLower

src/ClpModel.hpp:775

↓ 2 callersMethodgetColName

Return name of col if one exists or Rnnnnnnn

src/OsiClp/OsiClpSolverInterface.cpp:6793

↓ 2 callersFunctiongetColUpper

src/ClpModel.hpp:784

↓ 2 callersFunctiongetElements

A vector containing the elements in the packed matrix. Note that there might be gaps in this list, entries that do not belong to any

src/ClpPackedMatrix.hpp:57

↓ 2 callersFunctiongetNorms

src/ClpHelperFunctions.cpp:103

↓ 2 callersFunctiongetObjCoefficients

src/ClpModel.hpp:752

↓ 2 callersFunctiongetObjSense

src/ClpModel.hpp:508

↓ 2 callersMethodgetPresolvePasses

src/ClpSolve.cpp:4242

↓ 2 callersFunctiongetReducedCost

src/ClpModel.hpp:549

↓ 2 callersMethodgetReducedGradient

This method should not leave a permanent change in the solver. For this reason, save a copy of the cost region and replace it after we've calculat

src/OsiClp/OsiClpSolverInterface.cpp:7322

↓ 2 callersMethodgetRowActivity

Get pointer to array[getNumRows()] of row activity levels (constraint matrix times the solution vector */

src/OsiClp/OsiClpSolverInterface.cpp:6540

↓ 2 callersFunctiongetRowLower

src/ClpModel.hpp:558

↓ 2 callersMethodgetRowName

Return name of row if one exists or Rnnnnnnn we ignore maxLen

src/OsiClp/OsiClpSolverInterface.cpp:6765

↓ 2 callersFunctiongetRowUpper

src/ClpModel.hpp:567

↓ 2 callersMethodgetSolution

Given an existing factorization computes and checks primal and dual solutions. Uses input arrays for variables at bounds. Returns feasibility

src/ClpSimplex.cpp:1450

↓ 2 callersFunctiongetTolerance

src/ClpPresolve.cpp:1650

↓ 2 callersMethodgetVectorLengths

The lengths of the major-dimension vectors. */

src/ClpPlusMinusOneMatrix.cpp:1306

↓ 2 callersFunctiongetVectorStarts

src/ClpPackedMatrix.hpp:76

↓ 2 callersMethodgetVectorStarts

src/ClpPlusMinusOneMatrix.cpp:1300

↓ 2 callersMethodgoDenseOrSmall

Go over to dense code

src/ClpFactorization.cpp:1386

↓ 2 callersFunctiongoodAccuracy

Returns true if model looks OK

src/ClpSimplex.hpp:866

↓ 2 callersMethodguess

Create a string of commands to guess at best strategy for model At present mode is ignored

src/ClpSimplexOther.cpp:11036

↓ 2 callersMethodgutsOfInitialize

Initializes arrays

src/AbcSimplex.cpp:318

↓ 2 callersMethodgutsOfResize

src/AbcSimplex.cpp:396

↓ 2 callersMethodgutsOfSolution

src/ClpSimplex.cpp:574

↓ 2 callersMethodidentifyCompatibleCols

Identify the primal compatible columns in a subset of columns The input argument is a temporary array that is needed for the Clp's BTRAN if which

src/ClpPESimplex.cpp:312

↓ 2 callersMethodidentifyCompatibleRows

Identify the dual compatible rows */

src/ClpPESimplex.cpp:433

↓ 2 callersFunctioninCbcBranchAndBound

src/ClpModel.hpp:1209

↓ 2 callersFunctioninit_CoinPrePostsolveMatrix

Assumptions: 1. nrows>=m.getNumRows() 2. ncols>=m.getNumCols() In presolve, these values are equal. In postsolve, they may be inequal, since the redu

src/ClpPresolve.cpp:1670

↓ 2 callersMethodinitialDualSolve

General dual solve

src/ClpSolve.cpp:4078

↓ 2 callersMethodinitialPrimalSolve

General primal solve

src/ClpSolve.cpp:4086

↓ 2 callersMethodinitialSolve

############################################################################ Solve methods ###########################################################

src/OsiClp/OsiClpSolverInterface.cpp:72

↓ 2 callersFunctionintValue

src/CbcOrClpParam.hpp:455

↓ 2 callersFunctionintegerType

Return integer type (0,1,2=optional,3=sc,4=scint)

src/OsiClp/OsiClpSolverInterface.hpp:499

↓ 2 callersMethodisColOrdered

src/ClpPlusMinusOneMatrix.cpp:1456

↓ 2 callersMethodisColumn

Returns 1 if sequence indicates column

src/AbcSimplex.hpp:728

↓ 2 callersFunctionisDense

src/ClpFactorization.cpp:145

↓ 2 callersMethodisDualObjectiveLimitReached

src/ClpModel.cpp:3864

↓ 2 callersMethodisIterationLimitReached

src/OsiClp/OsiClpSolverInterface.cpp:1922

↓ 2 callersMethodisPrimalObjectiveLimitReached

src/ClpModel.cpp:3844

↓ 2 callersMethodkeyValue

Gets key value when none in small

src/ClpDynamicMatrix.cpp:1603

↓ 2 callersFunctionlargeValue

Large bound value (for complementarity etc)

src/ClpSimplex.hpp:1003

↓ 2 callersFunctionlastCount

Previous Row/Column with count

src/CoinAbcBaseFactorization.hpp:174

↓ 2 callersMethodlistTransposeTimes

Return <code>x *A</code> in <code>z</code> but just for number indices in y. Default cheats with fake CoinIndexedVector and then calls subset

src/ClpMatrixBase.cpp:189

↓ 2 callersMethodloadProblem

src/OsiClp/OsiClpSolverInterface.cpp:4761

↓ 2 callersFunctionlower

src/ClpSimplex.hpp:1339

↓ 2 callersFunctionlpPhaseOpenTable

src/ClpOutput.cpp:255

↓ 2 callersMethodmakeNonSingular

Makes a non-singular basis by replacing variables

src/CoinAbcDenseFactorization.cpp:333

↓ 2 callersMethodmatVecMult

src/ClpLsqr.cpp:305

↓ 2 callersMethodmatchName

Returns name which could match

src/CbcOrClpParam.cpp:359

↓ 2 callersMethodmatches

src/Attic/ClpParam.cpp:539

↓ 2 callersFunctionmatrix_bounds_ok

src/ClpPresolve.cpp:1759

↓ 2 callersMethodmaximumPivotsChanged

Called when maximum pivots changes

src/ClpDualRowSteepest.cpp:1097

↓ 2 callersMethodminiSolve

mini presolve and solve

src/ClpSimplexOther.cpp:11022

↓ 2 callersMethodmoveStatusToClp

Move status and solution to ClpSimplex

src/AbcSimplex.cpp:5932

↓ 2 callersMethodmoveToBasic

Moves basic stuff to basic area

src/AbcSimplex.cpp:984

↓ 2 callersFunctionmyamlf

src/ClpCholeskyBase.cpp:1115

↓ 2 callersFunctionnextCount

Next Row/Column with count

src/CoinAbcBaseFactorization.hpp:168

↓ 2 callersMethodnumberCoefficients

Number of coefficients

src/ClpConstraintLinear.cpp:194

↓ 2 callersMethodnumberFixed

Return number fixed to see if worth presolving

src/ClpInterior.cpp:1090

↓ 2 callersMethodnumberSprintColumns

Returns number of extra columns for sprint algorithm - 0 means off. Also number of iterations before recompute */

src/AbcPrimalColumnPivot.cpp:71

↓ 2 callersFunctionobjectiveAsObject

Objective methods

src/ClpModel.hpp:1073

↓ 2 callersMethodoriginalBound

Restores bound to original bound

src/ClpSimplexOther.cpp:5795

↓ 2 callersFunctionparallelDual5a

src/AbcSimplexParallel.cpp:1804

↓ 2 callersFunctionpdxxxresid1

src/ClpHelperFunctions.hpp:130

↓ 2 callersMethodpermuteOut

Permutes out - bit settings same as stateOfProblem

src/AbcSimplex.cpp:5314

↓ 2 callersFunctionpivots

Returns number of pivots since factorization

src/ClpFactorization.hpp:189

↓ 2 callersMethodpopMessageHandler

back to previous message handler

src/ClpModel.cpp:2860

↓ 2 callersMethodpop_back

Get rid of last one

src/OsiClp/OsiClpSolverInterface.cpp:9151

↓ 2 callersMethodpostProcess

define DENSE_PERMUTE Does post processing on valid factorization - putting variables on correct rows

src/CoinAbcDenseFactorization.cpp:366

↓ 2 callersMethodprimalSLP

A sequential LP method

src/ClpSimplexNonlinear.cpp:2929

↓ 2 callersMethodprintLongHelp

TODO: Fix this Print Long help

src/Attic/ClpParam.cpp:772

↓ 2 callersFunctionprintSol

src/unitTest.cpp:220

↓ 2 callersMethodpushMessageHandler

Pass in Message handler (not deleted at end) and return current

src/ClpModel.cpp:2849

↓ 2 callersMethodputStuffInBasis

Puts more stuff in basis 1 bit set - do even if basis exists 2 bit set - don't bother staying triangular */

src/AbcSimplex.cpp:2650

↓ 2 callersFunctionracing_set_openblas_threads

src/ClpRacingSolver.cpp:30

↓ 2 callersMethodrawObjectiveValue

Raw objective value (so always minimize in primal)

src/AbcSimplex.hpp:1018

↓ 2 callersMethodreadGMPL

Read GMPL files from the given filenames

src/ClpModel.cpp:3760

↓ 2 callersMethodreadLp

Read file in LP format from file with name filename.

src/ClpSimplex.cpp:8015

← previous next →701–800 of 3,454, ranked by callers