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

FunctionallElementsInRange

Checks if all elements are in valid range. Can just return true if you are not paranoid. For Clp I will probably expect no zeros.

src/ClpMatrixBase.hpp:146

MethodallSlackBasis

Sets up all slack basis and resets solution to as it was after initial load or readMps */

src/AbcSimplex.cpp:4351

FunctionalmostDestructor

Allows change of pivot accuracy check 1.0 == none >1.0 relaxed inline void relaxAccuracyCheck(double /*value*/) { abort(); } Delete all stuff (leaves

src/AbcSimplexFactorization.hpp:410

FunctionalmostDestructor

Delete all stuff (leaves as after CoinFactorization())

src/ClpFactorization.hpp:381

Alpha (pivot element) for use by classes e.g. steepestedge

src/ClpSimplex.hpp:1077

FunctionalternateWeights

alternate weight array

src/ClpPrimalColumnSteepest.hpp:145

MethodalwaysOptimal

Do not change infeasibility cost and always say optimal

src/ClpSimplexPrimal.cpp:3226

MethodalwaysOptimal

Do not change infeasibility cost and always say optimal

src/AbcSimplexPrimal.cpp:3262

C--------------------------------------------------------------------------*/

src/ClpCholeskyBase.cpp:1789

MethodappendCols

src/ClpPlusMinusOneMatrix.cpp:1530

MethodappendCols

src/ClpNetworkMatrix.cpp:1077

MethodappendMatrix

Append a set of rows/columns to the end of the matrix. Returns number of errors i.e. if any of the new rows/columns contain an index that's larger

src/ClpPlusMinusOneMatrix.cpp:2147

MethodappendMatrix

Append a set of rows/columns to the end of the matrix. Returns number of errors i.e. if any of the new rows/columns contain an index that's larger

src/ClpPackedMatrix.cpp:5706

MethodappendMatrix

Append a set of rows/columns to the end of the matrix. Returns number of errors i.e. if any of the new rows/columns contain an index that's larger

src/ClpNetworkMatrix.cpp:1137

MethodappendRows

src/ClpPlusMinusOneMatrix.cpp:1592

MethodappendRows

src/ClpNetworkMatrix.cpp:1120

MethodapplyColCut

src/OsiClp/OsiClpSolverInterface.cpp:5716

FunctionareaFactor

Whether larger areas needed

src/AbcSimplexFactorization.hpp:318

MethodarrayForFlipBounds

src/AbcSimplex.hpp:528

MethodarrayForFlipRhs

src/AbcSimplex.hpp:532

MethodarrayForFtran

src/AbcSimplex.hpp:540

MethodarrayForReplaceColumn

src/AbcSimplex.hpp:524

MethodassignBasisStatus

src/AbcWarmStart.cpp:24

MethodassignProblem

src/OsiClp/OsiClpSolverInterface.cpp:4809

MethodatFakeBound

src/AbcSimplex.cpp:6033

FunctionautomaticScaling

If automatic scaling on

src/ClpSimplex.hpp:1044

FunctionaverageTheta

src/AbcNonLinearCost.hpp:233

FunctionaverageTheta

src/ClpNonLinearCost.hpp:331

src/ClpCholeskyDense.cpp:552

FunctionbackToBasics

Gets rid of any mutable by products

src/ClpMatrixBase.hpp:370

Functionbackward

Backward pointer to set number

src/ClpGubMatrix.hpp:282

FunctionbadTimes

number of bad times

src/ClpSolve.hpp:379

FunctionbarrierPointer

src/ClpSimplex.hpp:2100

FunctionbaseIteration

Iteration when we entered dual or primal

src/ClpSimplex.hpp:1651

src/CoinAbcBaseFactorization.hpp:191

FunctionbaseModel

See if we have base model

src/ClpSimplex.hpp:213

MethodbaseModel

See if we have base model

src/AbcSimplex.hpp:147

MethodbasisIsAvailable

Returns true if a basis is available and optimal

src/OsiClp/OsiClpSolverInterface.cpp:7818

Works out best one

src/OsiClp/OsiClpSolverInterface.cpp:9128

MethodbestPivot

Finds best possible pivot

src/ClpSimplexOther.cpp:5105

FunctionbestPossibleImprovement

Best possible improvement using djs (primal) or obj change by flipping bounds to make dual feasible (dual) */

src/ClpSimplex.hpp:1404

FunctionblasNumThreads

Maximum number of BLAS threads to use during LP solves (e.g. OpenBLAS). -1 (default) means no restriction. Set to 1 to prevent thread mul

src/ClpSimplex.hpp:1499

MethodborrowModel

Borrow model. This is so we dont have to copy large amounts of data around. It assumes a derived class wants to overwrite an empty model with

src/ClpInterior.cpp:1080

FunctionbranchingValue

Initial value of integer variable

src/ClpNode.hpp:63

src/ClpPresolve.cpp:896

FunctioncallBack

Call back function - just says whenever it gets Clp0005 or Coin0002 */

examples/driverC.c:17

FunctioncanCombine

Returns true if can combine transposeTimes and subsetTransposeTimes and if it would be faster */

src/ClpPlusMinusOneMatrix.hpp:452

FunctioncanCombine

Returns true if can combine transposeTimes and subsetTransposeTimes and if it would be faster */

src/ClpMatrixBase.hpp:322

MethodcanCombine

Returns true if can combine transposeTimes and subsetTransposeTimes and if it would be faster */

src/ClpPlusMinusOneMatrix.cpp:1862

MethodcanDoPartialPricing

Says whether it can do partial pricing

src/ClpPlusMinusOneMatrix.cpp:1711

MethodcanDoPartialPricing

Says whether it can do partial pricing

src/ClpPackedMatrix.cpp:5257

MethodcanDoPartialPricing

Says whether it can do partial pricing

src/ClpNetworkMatrix.cpp:832

MethodcanDoSimplexInterface

Returns true if has OsiSimplex methods Returns 1 if can just do getBInv etc 2 if has all OsiSimplex methods and 0 if it has none */

src/OsiClp/OsiClpSolverInterface.cpp:8471

FunctioncanGetRowCopy

Returns true if can create row copy

src/ClpMatrixBase.hpp:124

MethodchangeBound

As changeBounds but just changes new bounds for a single variable. Returns true if change */

src/ClpSimplexDual.cpp:6445

MethodchangeBounds

Checks if any fake bounds active - if so returns number and modifies dualBound_ and everything. Free variables will be left as free Returns number of

src/ClpSimplexDual.cpp:3148

FunctionchangeDownInCost

src/AbcNonLinearCost.hpp:162

FunctionchangeDownInCost

src/ClpNonLinearCost.hpp:198

FunctionchangeInCost

Returns change in cost - one down if alpha >0.0, up if <0.0 Value is current - new */

src/AbcNonLinearCost.hpp:154

FunctionchangeInCost

Returns change in cost - one down if alpha >0.0, up if <0.0 Value is current - new */

src/ClpNonLinearCost.hpp:168

FunctionchangeUpInCost

src/AbcNonLinearCost.hpp:158

FunctionchangeUpInCost

src/ClpNonLinearCost.hpp:183

Functionchanged

Returns if changed from beginning of iteration

src/ClpNonLinearCost.hpp:294

src/OsiClp/OsiClpSolverInterface.cpp:10997

MethodcheckAccuracy

Checks accuracy - just for debug

src/AbcPrimalColumnSteepest.cpp:1836

MethodcheckAccuracy

Checks accuracy - just for debug

src/ClpPrimalColumnSteepest.cpp:3911

MethodcheckAccuracy

checks accuracy and may re-initialize (may be empty)

src/ClpDualRowPivot.cpp:55

MethodcheckBlocks

Debug - check blocks */

src/ClpPackedMatrix.cpp:7886

MethodcheckBothSolutions

This sets sum and number of infeasibilities (Dual and Primal) */

src/ClpSimplex.cpp:3226

MethodcheckBothSolutions

This sets sum and number of infeasibilities (Dual and Primal) */

src/AbcSimplex.cpp:2952

MethodcheckChanged

Puts back correct infeasible costs for each variable The input indices are row indices and need converting to sequences for costs. On input a

src/ClpNonLinearCost.cpp:1455

MethodcheckChanged

Puts back correct infeasible costs for each variable The input indices are row indices and need converting to sequences for costs. On input a

src/AbcNonLinearCost.cpp:543

MethodcheckCompatibilityCol

Check that a nonbasic variable is indeed contemptible */

src/ClpPESimplex.cpp:631

MethodcheckConsistency

checkConsistency. Checks that row and column copies look OK

src/CoinAbcBaseFactorization1.cpp:3378

MethodcheckCutoff

see if cutoff reached

src/AbcSimplexDual.cpp:3715

For debug - summarizes dj situation

src/AbcSimplex.cpp:5622

MethodcheckDoubleParameter

src/CbcOrClpParam.cpp:794

MethodcheckDoubleParameter

src/Attic/ClpParam.cpp:377

MethodcheckDualRatios

Row array has row part of pivot row Column array has column part. This is used in dual ranging */

src/ClpSimplexOther.cpp:266

MethodcheckDualSolution

src/ClpSimplex.cpp:3070

MethodcheckDualSolution

src/AbcSimplex.cpp:2867

MethodcheckFeasible

Just for debug - may be extended to other matrix types later. Returns number and sum of primal infeasibilities. */

src/ClpGubDynamicMatrix.cpp:1969

MethodcheckGoodMove

method: sees if looks plausible change in complementarity

src/ClpPredictorCorrector.cpp:2768

MethodcheckGoodMove2

: checks for one step size

src/ClpPredictorCorrector.cpp:2941

MethodcheckInfeasibilities

Changes infeasible costs and computes number and cost of infeas We will need to re-think objective offsets later We will also need a 2 bit per variabl

src/AbcNonLinearCost.cpp:234

MethodcheckLinks

static int ixxxxxx=0;

src/CoinAbcBaseFactorization1.cpp:4459

FunctioncheckMarkArrays

src/AbcSimplexFactorization.hpp:466

MethodcheckMarkArrays

src/CoinAbcDenseFactorization.hpp:167

MethodcheckMoveBack

For debug - moves solution back to external and computes stuff

src/AbcSimplex.cpp:5485

MethodcheckPivot

src/CoinAbcBaseFactorization4.cpp:94

MethodcheckPossibleCleanup

Row array has row part of pivot row Column array has column part. This is used in cleanup */

src/ClpSimplexDual.cpp:7939

MethodcheckPossibleValuesMove

Row array has row part of pivot row Column array has column part. This is used in dual values pass */

src/ClpSimplexDual.cpp:7736

MethodcheckPrimalRatios

Row array has pivot column This is used in primal ranging */

src/ClpSimplexOther.cpp:958

MethodcheckPrimalSolution

This sets largest infeasibility and most infeasible

src/AbcSimplex.cpp:2816

MethodcheckReplace

Checks if can replace one Column to basis, returns 0=OK, 1=Probably OK, 2=singular, 3=no room, 5 max pivots Fills in region for use later

src/CoinAbcDenseFactorization.hpp:245

MethodcheckReplace

Checks if can replace one Column to basis, returns 0=OK, 1=Probably OK, 2=singular, 3=no room, 5 max pivots Fills in region for use later par

src/AbcSimplexFactorization.cpp:657

MethodcheckReplace

returns 0 - OK 1 - take iteration then re-factorize 2 - flag something and skip 3 - break and re-factorize 5 - take iteration then re-facto

src/AbcSimplexDual.cpp:5513

MethodcheckReplace

Checks if can replace one Column to basis, returns 0=OK, 1=Probably OK, 2=singular, 3=no room, 5 max pivots Fills in region for use later par

src/CoinAbcBaseFactorization4.cpp:350

MethodcheckReplacePart1

Checks if can replace one Column to basis, returns update alpha Fills in region for use later partial update already in U */

src/CoinAbcDenseFactorization.hpp:277

MethodcheckReplacePart1

src/CoinAbcBaseFactorization4.cpp:1253

← previous next →1,501–1,600 of 3,454, ranked by callers