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

↓ 4 callersMethodprimalExpanded

utility primal function for dealing with dynamic constraints mode=n see ClpGubMatrix.hpp for definition Remember to update here when settled

src/ClpGubMatrix.cpp:2076

↓ 4 callersMethodprimalPivotResult

Pivot in a variable and choose an outgoing one. Assumes primal feasible - will not go through a bound. Returns step length in theta Returns ra

src/ClpSimplex.cpp:9397

↓ 4 callersFunctionprimalRowSolution

Primal row solution

src/ClpModel.hpp:514

↓ 4 callersMethodreadBasis

Read a basis from the given filename

src/ClpSimplex.cpp:6577

↓ 4 callersMethodreducedGradient

Solves non-linear using reduced gradient

src/ClpSimplex.cpp:6600

↓ 4 callersMethodreplaceColumnPart3

src/AbcSimplexDual.cpp:5478

↓ 4 callersMethodresetRowsDropped

reset numberRowsDropped and rowsDropped.

src/ClpCholeskyBase.cpp:205

↓ 4 callersMethodrowEnd

src/AbcMatrix.cpp:3589

↓ 4 callersMethodrowStart

src/AbcMatrix.cpp:3583

↓ 4 callersMethodsaveInfo

src/OsiClp/OsiClpSolverInterface.cpp:11072

↓ 4 callersMethodsetColSolution

-----------------------------------------------------------------------------

src/OsiClp/OsiClpSolverInterface.cpp:4313

↓ 4 callersMethodsetCurrentOption

src/Attic/ClpParam.cpp:652

↓ 4 callersMethodsetCurrentWanted

src/AbcMatrix.hpp:367

↓ 4 callersMethodsetDimensions

Set the dimensions of the matrix. In effect, append new empty columns/rows to the matrix. A negative number for either dimension means that that

src/ClpPackedMatrix.cpp:5695

↓ 4 callersMethodsetFactorization

src/ClpSimplex.cpp:4998

↓ 4 callersMethodsetFakeKeyWord

Sets value of fake keyword to current size of keywords

src/CbcOrClpParam.cpp:288

↓ 4 callersMethodsetLooksOptimal

Sets optimality flag (for advanced use)

src/AbcPrimalColumnPivot.hpp:87

↓ 4 callersMethodsetParallelMode

set parallel mode

src/AbcSimplex.hpp:893

↓ 4 callersFunctionsetPivoted

src/ClpSimplex.hpp:1540

↓ 4 callersFunctionsetProblemStatus

Set problem status

src/ClpModel.hpp:446

↓ 4 callersMethodsetRowLower

Set a single row lower bound<br> Use -DBL_MAX for -infinity. */

src/ClpModel.cpp:532

↓ 4 callersMethodsetRowUpper

Set a single row upper bound<br> Use DBL_MAX for infinity. */

src/ClpModel.cpp:542

↓ 4 callersMethodsetSequenceOut

src/AbcSimplex.hpp:707

↓ 4 callersMethodsetSolveMode

Set solve mode e.g. 0 C++ code, 1 Lapack, 2 choose If 4 set then values pass if 8 set then has iterated */

src/CoinAbcDenseFactorization.hpp:183

↓ 4 callersMethodstartup

Common bits of coding for dual and primal

src/ClpSimplex.cpp:9430

↓ 4 callersMethodsubsetClone

Subset clone (without gaps). Duplicates are allowed and order is as given */

src/ClpGubMatrix.cpp:381

↓ 4 callersMethodswitchOffSprint

Switch off sprint idea

src/AbcPrimalColumnPivot.cpp:76

↓ 4 callersMethodtransposeTimes

src/ClpPackedMatrix.cpp:362

↓ 4 callersFunctiontransposeTimes3BitSlacks

src/ClpPackedMatrix.cpp:9414

↓ 4 callersMethodupdate

Update pseudo costs

src/ClpNode.cpp:922

↓ 4 callersMethodupdateColumnTranspose

Updates one column (BTRAN) from region2 region1 starts as zero and is zero at end */

src/ClpFactorization.cpp:946

↓ 4 callersMethodupdateDualsInDual

src/AbcSimplexDual.cpp:570

↓ 4 callersMethodupdateFullColumn

Updates one full column (FTRAN) */

src/CoinAbcBaseFactorization3.cpp:104

↓ 4 callersMethodupdateFullColumnTranspose

Updates one column (BTRAN) from unpacked regionSparse */

src/CoinAbcDenseFactorization.hpp:579

↓ 4 callersMethodupdateTwoColumnsFT

Updates one column (FTRAN) from region2 Tries to do FT update number returned is negative if no room. Also updates region3 region1 starts

src/ClpFactorization.cpp:918

↓ 4 callersMethodupdateWeights2

Actually updates weights

src/AbcDualRowSteepest.cpp:779

↓ 4 callersMethodway

Way for integer variable -1 down , +1 up */

src/ClpNode.cpp:651

↓ 3 callersFunctionCoinAbcDgetrf

src/AbcSimplexParallel.cpp:2491

↓ 3 callersFunctionCoinAbcGatherUpdate

src/CoinAbcHelperFunctions.hpp:720

↓ 3 callersFunctionCoinAbcMinMaxAbsNormalValues

src/CoinAbcHelperFunctions.cpp:329

↓ 3 callersMethodadd

Adds multiple of a column into an CoinIndexedvector You can use quickAdd to add to vector */

src/ClpPlusMinusOneMatrix.cpp:1231

↓ 3 callersFunctionaddLink

Adds a link in chain of equal counts

src/CoinAbcBaseFactorization.hpp:693

↓ 3 callersMethodaddRow

-----------------------------------------------------------------------------

src/OsiClp/OsiClpSolverInterface.cpp:4540

↓ 3 callersMethodappendCols

src/ClpMatrixBase.cpp:150

↓ 3 callersMethodarrayForDualColumn

src/AbcSimplex.hpp:515

↓ 3 callersMethodarrayForTableauRow

src/AbcSimplex.hpp:544

↓ 3 callersMethodborrowModel

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/ClpModel.cpp:960

↓ 3 callersFunctionbuildTSP_MTZ

─── TSP-MTZ LP relaxation ─────────────────────────────────────────────────── Asymmetric TSP with Miller-Tucker-Zemlin subtour elimination. n cities,

test/test_racing_lp.cpp:199

↓ 3 callersMethodchangeBound

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

src/AbcSimplexDual.cpp:3910

↓ 3 callersMethodclearArraysPublic

Clears an array and says available (-1 does all) when no possibility of going parallel */

src/AbcSimplex.hpp:876

↓ 3 callersFunctionclpMatrix

src/ClpModel.hpp:819

↓ 3 callersFunctionclpmodel

examples/ekk_interface.cpp:20

↓ 3 callersFunctioncoDegeneratePivots

src/ClpPESimplex.hpp:125

↓ 3 callersFunctioncomputeDualsAndCheck

src/AbcSimplexDual.cpp:2295

↓ 3 callersFunctioncomputePrimalsAndCheck

src/AbcSimplexDual.cpp:2287

↓ 3 callersMethodcopy

Copy contents - resizing if necessary - otherwise re-use memory

src/ClpModel.cpp:937

↓ 3 callersMethodcost

src/AbcSimplex.hpp:837

↓ 3 callersMethodcurrentDualBound

Current dualBound (will end up as dualBound_)

src/AbcSimplex.hpp:314

↓ 3 callersFunctiondeBound

src/ClpSolve.cpp:6056

↓ 3 callersMethoddeleteIntegerInformation

Drop integer informations

src/ClpModel.cpp:3944

↓ 3 callersMethoddisableSimplexInterface

Undo whatever setting changes the above method had to make

src/OsiClp/OsiClpSolverInterface.cpp:6955

↓ 3 callersMethoddualColumn1A

Array has tableau row Puts candidates in list Returns upper theta (infinity if no pivot) and may set sequenceIn_ if free */

src/AbcSimplexDual.cpp:1145

↓ 3 callersFunctiondualTolerance

Dual tolerance to use

src/ClpModel.hpp:357

↓ 3 callersMethodfakeDjs

src/AbcSimplex.hpp:659

↓ 3 callersMethodfeasibleBounds

Puts feasible bounds into lower and upper

src/ClpNonLinearCost.cpp:1123

↓ 3 callersMethodfixFixed

fix variables interior says should be

src/ClpInterior.cpp:1113

↓ 3 callersMethodflipBounds

While updateDualsInDual sees what effect is of flip this does actual flipping. If change >0.0 then value in array >0.0 => from lower to upper

src/AbcSimplexDual.cpp:3749

↓ 3 callersMethodgetAreas

getAreas. Gets space for a factorization called by constructors

src/CoinAbcBaseFactorization1.cpp:570

↓ 3 callersMethodgetElements

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 major-dimen

src/ClpNetworkMatrix.cpp:694

↓ 3 callersMethodgetStrParam

src/OsiClp/OsiClpSolverInterface.cpp:1815

↓ 3 callersFunctiongetVectorLengths

The lengths of the major-dimension vectors. */

src/ClpPackedMatrix.hpp:81

↓ 3 callersMethodgoBackAll

src/ClpNonLinearCost.cpp:1322

↓ 3 callersFunctiongoSparse

makes a row copy of L for speed and to allow very sparse problems */

src/CoinAbcBaseFactorization.hpp:564

↓ 3 callersMethodgutsOfDestructor

The real work of constructors etc

src/CoinAbcBaseFactorization1.cpp:49

↓ 3 callersMethodgutsOfTransposeTimesUnscaled

Meat of transposeTimes by column when not scaled

src/ClpPackedMatrix.cpp:1484

↓ 3 callersFunctionhashValue

Returns a hash value

src/ClpSimplexOther.cpp:8096

↓ 3 callersMethodindices

Returns array to put basis indices in

src/CoinAbcDenseFactorization.hpp:597

↓ 3 callersMethodisAbandoned

src/OsiClp/OsiClpSolverInterface.cpp:1832

↓ 3 callersFunctionisProvenOptimal

Is optimality proven?

src/ClpModel.hpp:480

↓ 3 callersMethodmarkNonlinear

Given a zeroed array sets nonlinear columns to 1. Returns number of nonlinear columns */

src/ClpObjective.cpp:67

↓ 3 callersMethodmodel

Return pointer to presolved model

src/ClpPresolve.cpp:151

↓ 3 callersMethodnonlinearSLP

Solves nonlinear problem using SLP - may be used as crash for other algorithms when number of iterations small */

src/ClpSimplex.cpp:6585

↓ 3 callersMethodparametrics

Parametrics This is an initial slow version. The code uses current bounds + theta * change (if change array not NULL) and similarly for objec

src/ClpSimplexOther.cpp:2554

↓ 3 callersFunctionpdxxxmerit

src/ClpHelperFunctions.hpp:92

↓ 3 callersFunctionpdxxxresid2

src/ClpHelperFunctions.hpp:192

↓ 3 callersMethodperturb

Perturbs problem

src/AbcSimplexDual.cpp:4339

↓ 3 callersFunctionpivotColumn

Returns address of pivotColumn region (also used for permuting)

src/ClpFactorization.hpp:165

↓ 3 callersFunctionpivotRow

Pivot Row for use by classes e.g. steepestedge

src/ClpSimplex.hpp:1096

↓ 3 callersMethodpivotRow

Returns pivot row, -1 if none

src/ClpDualRowSteepest.cpp:179

↓ 3 callersMethodprimalRanging

Primal ranging. This computes increase/decrease in value for each given variable and corresponding sequence numbers which would change basis. S

src/ClpSimplex.cpp:6516

↓ 3 callersFunctionreducedCost

src/ClpSimplex.hpp:1331

↓ 3 callersMethodreplaceColumns

0 success, -1 can't +1 accuracy problems

src/CoinAbcDenseFactorization.hpp:262

↓ 3 callersFunctionreplaceMatrix

Replace Clp Matrix (current is not deleted unless told to and new is used) So up to user to delete current. This was used where mat

src/ClpModel.hpp:852

↓ 3 callersMethodresetFakeBounds

src/AbcSimplexDual.cpp:3975

↓ 3 callersMethodrestoreFromDual

Restores solution from dualized problem

src/ClpSimplexOther.cpp:1397

↓ 3 callersMethodreturnModel

Return model - nulls all arrays so can be deleted safely

src/ClpModel.cpp:986

↓ 3 callersMethodrowColumns

src/AbcMatrix.cpp:3605

↓ 3 callersFunctionscan

Scans region to find nonzeros

src/CoinAbcBaseFactorization.hpp:380

↓ 3 callersMethodsetAvailableArray

Say array going available

src/AbcSimplex.hpp:925

↓ 3 callersFunctionsetCbcOrClpReadMode

src/CbcOrClpParam.cpp:76

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