MCPcopy Create free account

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

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

↓ 5 callersFunctioncostRegion
src/ClpSimplex.hpp:1184
↓ 5 callersMethodcountBasis
returns number of elements in column part of basis,
src/AbcMatrix.cpp:298
↓ 5 callersMethodenableSimplexInterface
Clp's copy-in/copy-out design paradigm is a challenge for the simplex modes. Normal operation goes like this: * startup() loads clp's work array
src/OsiClp/OsiClpSolverInterface.cpp:6914
↓ 5 callersMethodextendUpdated
expands an updated column to allow for extra rows which the main solver does not know about and returns number added. */
src/ClpGubMatrix.cpp:1782
↓ 5 callersMethodfillBasis
src/AbcMatrix.cpp:312
↓ 5 callersMethodforceOtherFactorization
If nonzero force use of 1,dense 2,small 3,osl
src/ClpFactorization.cpp:1414
↓ 5 callersFunctiongetInfinity
Get solver's value for infinity
src/OsiClp/OsiClpSolverInterface.hpp:524
↓ 5 callersFunctiongetObjSense
Get objective function sense (1 for min (default), -1 for max)
src/OsiClp/OsiClpSolverInterface.hpp:457
↓ 5 callersMethodgetReducedCost
Get a pointer to array[getNumCols()] of reduced costs
src/OsiClp/OsiClpSolverInterface.cpp:6527
↓ 5 callersMethodgetRightHandSide
------------------------------------------------------------------
src/OsiClp/OsiClpSolverInterface.cpp:3968
↓ 5 callersMethodgetRowPrice
Get pointer to array[getNumRows()] of dual prices
src/OsiClp/OsiClpSolverInterface.cpp:6514
↓ 5 callersMethodgetRowRange
------------------------------------------------------------------
src/OsiClp/OsiClpSolverInterface.cpp:3974
↓ 5 callersMethodgetRowSense
------------------------------------------------------------------
src/OsiClp/OsiClpSolverInterface.cpp:3962
↓ 5 callersMethodgutsOfDual
src/AbcSimplexDual.cpp:302
↓ 5 callersFunctionintegerInformation
Integer information
src/ClpModel.hpp:871
↓ 5 callersMethodisDualObjectiveLimitReached
src/OsiClp/OsiClpSolverInterface.cpp:1888
↓ 5 callersMethodlooksOptimal
Returns true if would not find any row
src/ClpDualRowSteepest.cpp:1069
↓ 5 callersFunctionlpPhaseRow
src/ClpOutput.cpp:272
↓ 5 callersMethodmatchName
Returns name which could match
src/Attic/ClpParam.cpp:522
↓ 5 callersMethodminimumPivotTolerance
src/CoinAbcDenseFactorization.cpp:752
↓ 5 callersMethodmodifyCoefficient
Modify one element of packed matrix. An element may be added. This works for either ordering If the new element is zero it will be deleted unle
src/ClpMatrixBase.cpp:556
↓ 5 callersFunctionnumberPrimalInfeasibilities
Number of primal infeasibilities
src/ClpSimplex.hpp:781
↓ 5 callersMethodnumberRowBlocks
Number of actual row blocks
src/AbcMatrix.hpp:405
↓ 5 callersFunctionobjectiveOffset
Objective offset
src/ClpModel.hpp:375
↓ 5 callersMethodpermuteBack
Returns permute back
src/CoinAbcDenseFactorization.cpp:814
↓ 5 callersMethodpivotRegion
src/CoinAbcDenseFactorization.hpp:129
↓ 5 callersFunctionpreProcessingMode
Get preprocessing mode
src/OsiClp/OsiClpSolverInterface.hpp:1237
↓ 5 callersMethodprimalColumnPivot
primal column pivot choice
src/AbcSimplex.hpp:324
↓ 5 callersMethodsaveModel
Save model to file, returns 0 if success
src/ClpSimplex.cpp:7182
↓ 5 callersMethodscaleObjective
If input negative scales objective so maximum <= -value and returns scale factor used. If positive unscales and also redoes dual stuff */
src/ClpSolve.cpp:5187
↓ 5 callersMethodsetIntParam
src/OsiClp/OsiClpSolverInterface.cpp:1762
↓ 5 callersFunctionsetLowerBound
To say a variable has lower bound
src/ClpInterior.hpp:382
↓ 5 callersMethodsetOneOutgoing
Sets bounds and cost for outgoing variable may change value Returns direction */
src/ClpNonLinearCost.cpp:1790
↓ 5 callersMethodsetPersistenceFlag
Array persistence flag If 0 then as now (delete/new) 1 then only do arrays if bigger needed 2 as 1 but give a bit extra if bigger needed */
src/ClpSimplex.cpp:11463
↓ 5 callersMethodsetPivots
Sets number of pivots since factorization
src/CoinAbcDenseFactorization.hpp:66
↓ 5 callersFunctionsetReference
src/ClpPrimalColumnSteepest.hpp:199
↓ 5 callersMethodsetRowName
Set row name
src/ClpModel.cpp:4251
↓ 5 callersMethodsetSize
src/AbcWarmStart.cpp:16
↓ 5 callersFunctionsetUpperBound
To say a variable has upper bound
src/ClpInterior.hpp:396
↓ 5 callersMethodsolveMode
Get 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:175
↓ 5 callersFunctionstatus
Status of problem: -1 - unknown e.g. before solve or if postSolve says not optimal 0 - optimal 1 - primal infeasible
src/ClpModel.hpp:437
↓ 5 callersMethodswap
Swaps two variables (for now just updates basic list) and sets status
src/AbcSimplex.cpp:5914
↓ 5 callersMethodswitchOffCheck
Switches off dj checking each factorization (for BIG models)
src/ClpGubMatrix.cpp:4003
↓ 5 callersMethodthreadInfoPointer
src/AbcSimplex.hpp:1045
↓ 5 callersMethodtimesIncludingSlacks
Return A * scalar(+-1) *x</code> in <code>y</code>. @pre <code>x</code> must be of size <code>numColumns()+numRows()</code> @pre <code>y</code>
src/AbcMatrix.cpp:1117
↓ 5 callersMethodunboundedRay
src/ClpModel.cpp:2781
↓ 5 callersFunctionupdateColumnFT
Updates one column (FTRAN) Tries to do FT update number returned is negative if no room */
src/AbcSimplexFactorization.hpp:196
↓ 5 callersMethodupdateColumnTransposeCpu
Updates one column (BTRAN) */
src/CoinAbcDenseFactorization.cpp:690
↓ 5 callersMethodupdatePrimalSolutionAndWeights
src/AbcDualRowPivot.cpp:58
↓ 5 callersFunctionuseCompact
src/ClpOutput.hpp:210
↓ 5 callersFunctionuseUtf8
src/ClpOutput.hpp:206
↓ 5 callersMethodwantsTableauColumn
Returns true if wants tableauColumn in replaceColumn
src/CoinAbcDenseFactorization.cpp:824
↓ 4 callersFunctionCoinAbcDgetrf2
src/AbcSimplexParallel.cpp:2395
↓ 4 callersFunctionCoinAbcDgetrs
src/AbcSimplexParallel.cpp:2535
↓ 4 callersFunctionCoinAbcDlaswp
src/AbcSimplexParallel.cpp:2361
↓ 4 callersFunctionCoinAbcScatterZeroTo
regionTo[index[i]]=0.0
src/CoinAbcHelperFunctions.cpp:581
↓ 4 callersMethodarrayForBtran
src/AbcSimplex.hpp:536
↓ 4 callersFunctionbuildTSP40
test/test_racing_lp.cpp:570
↓ 4 callersMethodcheck
checks looks okay
src/ClpNetworkBasis.cpp:337
↓ 4 callersFunctioncheckBasis
src/ClpSimplexOther.cpp:9082
↓ 4 callersFunctioncheckCorrect
src/ClpSimplex.cpp:5047
↓ 4 callersMethodcheckPrimalSolution
This sets largest infeasibility and most infeasible
src/ClpSimplex.cpp:2989
↓ 4 callersFunctioncheckReplacePart1
src/AbcSimplexFactorization.hpp:78
↓ 4 callersMethodcheckScalingEtc
Checks if all going well - may rescale
src/ClpSolve.cpp:4652
↓ 4 callersMethodcleanMatrix
Really clean up matrix. a) eliminate all duplicate AND small elements in matrix b) remove all gaps and set extraGap_ and extraMajor_ to 0.0 c
src/ClpModel.cpp:1219
↓ 4 callersMethodcleanup
src/ClpSimplex.cpp:11203
↓ 4 callersMethodclearHiddenArrays
Clear all hidden arrays
src/CoinAbcDenseFactorization.hpp:271
↓ 4 callersFunctioncoinMessages
Return Coin messages
src/ClpModel.hpp:986
↓ 4 callersFunctioncolumnLower
Column Lower
src/ClpModel.hpp:771
↓ 4 callersFunctioncolumnUpper
Column Upper
src/ClpModel.hpp:780
↓ 4 callersMethodcostBasic
src/AbcSimplex.hpp:649
↓ 4 callersMethodcrunch
Does very cursory presolve. rhs is numberRows, whichRows is 3*numberRows and whichColumns is 2*numberColumns */
src/ClpSimplexOther.cpp:1774
↓ 4 callersFunctiondeleteChar
src/ClpModel.cpp:1173
↓ 4 callersMethoddeleteNamesAsChar
Delete char * version of names
src/ClpModel.cpp:4702
↓ 4 callersFunctiondoOneBlock
src/ClpPackedMatrix.cpp:6194
↓ 4 callersFunctiondualColumn0
src/ClpPackedMatrix.cpp:6109
↓ 4 callersMethoddualColumn1Row
gets sorted tableau row and a possible value of theta
src/AbcMatrix.cpp:1281
↓ 4 callersMethodelements
Returns array to put basis elements in
src/CoinAbcDenseFactorization.cpp:792
↓ 4 callersFunctioneventHandler
Event handler
src/ClpModel.hpp:1019
↓ 4 callersMethodfactor
Does most of factorization
src/CoinAbcBaseFactorization1.cpp:682
↓ 4 callersMethodfakeSuperBasic
Returns 1 if fake superbasic 0 if free or true superbasic -1 if was fake but has cleaned itself up (sets status) -2 if wasn't
src/AbcSimplex.hpp:769
↓ 4 callersMethodfastDual
treat no pivot as finished (unless interesting)
src/ClpSimplexDual.cpp:7241
↓ 4 callersFunctionfillEnv
src/CbcOrClpParam.cpp:1260
↓ 4 callersMethodgetAvailableArray
Returns first available empty array (and sets flag)
src/AbcSimplex.cpp:6019
↓ 4 callersFunctiongetDynamicStatusGen
src/ClpDynamicExampleMatrix.hpp:147
↓ 4 callersFunctiongetObjCoefficients
Get pointer to array[getNumCols()] of objective function coefficients
src/OsiClp/OsiClpSolverInterface.hpp:448
↓ 4 callersFunctiongetRowLower
Get pointer to array[getNumRows()] of row lower bounds
src/OsiClp/OsiClpSolverInterface.hpp:442
↓ 4 callersFunctiongetRowUpper
Get pointer to array[getNumRows()] of row upper bounds
src/OsiClp/OsiClpSolverInterface.hpp:445
↓ 4 callersMethodgetSolveType
src/ClpSolve.cpp:4220
↓ 4 callersFunctioninstrument_end_and_adjust
src/ClpSolve.cpp:478
↓ 4 callersFunctionlengthNames
length of names (0 means no names0
src/ClpModel.hpp:1039
↓ 4 callersMethodloadFromCoinModel
This loads a model from a coinModel object - returns number of errors
src/OsiClp/OsiClpSolverInterface.cpp:4984
↓ 4 callersMethodloadProblem
This loads a model from a CoinStructuredModel object - returns number of errors. If originalOrder then keep to order stored in blocks, otherwise
src/ClpSolve.cpp:4933
↓ 4 callersFunctionmaskMatches
src/ClpSolver.cpp:4514
↓ 4 callersFunctionmaskMatches
src/Attic/ClpSolver.cpp:4463
↓ 4 callersMethodnumberColumnBlocks
Number of actual column blocks
src/AbcMatrix.hpp:400
↓ 4 callersMethodnumberCpus
Number of cpus
src/AbcSimplex.hpp:898
↓ 4 callersMethodordinaryVariables
Set to 1 if no free or super basic
src/AbcSimplex.hpp:299
↓ 4 callersFunctionpdxxxstep
src/ClpHelperFunctions.hpp:251
↓ 4 callersFunctionpivotVariable
Basic variables pivoting on which rows
src/ClpSimplex.hpp:1039
← previousnext →401–500 of 3,454, ranked by callers