MCPcopy Create free account

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

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

↓ 1 callersFunctionsecondaryStatus
Secondary status of problem - may get extended 0 - none 1 - primal infeasible because dual limit reached OR (probably primal
src/ClpModel.hpp:466
↓ 1 callersFunctionsequenceIn
Return sequence In or Out */
src/ClpSimplex.hpp:1231
↓ 1 callersMethodsetBasisStatus
Set the status of structural/artificial variables Returns 0 if OK, 1 if problem is bad e.g. duplicate elements, too large ...
src/OsiClp/OsiClpSolverInterface.cpp:7086
↓ 1 callersMethodsetCallBack
Call back
src/Clp_C_Interface.cpp:188
↓ 1 callersFunctionsetCbcOrClpPrinting
src/CbcOrClpParam.cpp:68
↓ 1 callersFunctionsetCbcOrClpReadCommand
src/CbcOrClpParam.cpp:77
↓ 1 callersFunctionsetClpScaledMatrix
Sets pointer to scaled ClpPackedMatrix
src/ClpModel.hpp:829
↓ 1 callersFunctionsetCurrentStatus
src/ClpNonLinearCost.hpp:53
↓ 1 callersMethodsetDblParam
src/OsiClp/OsiClpSolverInterface.cpp:1769
↓ 1 callersFunctionsetDoubleParameter
Set double parameter
src/ClpCholeskyBase.hpp:172
↓ 1 callersMethodsetDoubleParameter
src/Attic/ClpParam.cpp:301
↓ 1 callersMethodsetFakeKeyWord
Sets value of fake keyword to current size of keywords
src/Attic/ClpParam.cpp:801
↓ 1 callersFunctionsetFakeLower
To say a variable has fake lower bound
src/ClpInterior.hpp:410
↓ 1 callersFunctionsetFakeUpper
To say a variable has fake upper bound
src/ClpInterior.hpp:424
↓ 1 callersFunctionsetFixed
To say a variable is fixed
src/ClpInterior.hpp:340
↓ 1 callersMethodsetFlagged
To flag a variable (not inline to allow for column generation)
src/ClpSimplex.cpp:9895
↓ 1 callersMethodsetFlagged
To flag a variable
src/AbcSimplex.cpp:4523
↓ 1 callersFunctionsetFlaggedSlack
src/ClpDynamicMatrix.hpp:179
↓ 1 callersMethodsetGubBasis
Sets basis from original
src/ClpSimplexOther.cpp:6719
↓ 1 callersMethodsetInitialDenseFactorization
Allow initial dense factorization
src/ClpSimplex.cpp:10059
↓ 1 callersMethodsetIntParameter
src/Attic/ClpParam.cpp:428
↓ 1 callersMethodsetModel
src/Clp_C_Interface.cpp:183
↓ 1 callersFunctionsetNumberElementsU
Setss number in U area
src/CoinAbcBaseFactorization.hpp:260
↓ 1 callersMethodsetNumberRows
Set number of Rows after factorization
src/CoinAbcDenseFactorization.hpp:81
↓ 1 callersMethodsetNumberSlacks
Sets number of slacks
src/CoinAbcDenseFactorization.hpp:76
↓ 1 callersFunctionsetObjCoeff
Set an objective function coefficient */
src/ClpModel.hpp:577
↓ 1 callersFunctionsetPersistenceFlag
src/ClpFactorization.hpp:375
↓ 1 callersMethodsetRowBounds
Set a single row lower and upper bound */
src/OsiClp/OsiClpSolverInterface.cpp:6706
↓ 1 callersMethodsetRowName
Set name of row
src/OsiClp/OsiClpSolverInterface.cpp:6750
↓ 1 callersMethodsetRowPrice
-----------------------------------------------------------------------------
src/OsiClp/OsiClpSolverInterface.cpp:4329
↓ 1 callersFunctionsetSecondaryStatus
src/ClpModel.hpp:470
↓ 1 callersMethodsetStopStart
set stop start
src/AbcSimplex.hpp:904
↓ 1 callersFunctionsetWhatsChanged
src/ClpModel.hpp:939
↓ 1 callersFunctionset_openblas_threads
src/OsiClp/OsiClpSolverInterface.cpp:15
↓ 1 callersMethodsetupForRepeatedUse
Sets up solver for repeated use by Osi interface. The normal usage does things like keeping factorization around so can be used. Will also do th
src/OsiClp/OsiClpSolverInterface.cpp:1707
↓ 1 callersMethodshow_self
show_self. Debug show object
src/CoinAbcBaseFactorization1.cpp:4406
↓ 1 callersMethodsolve
Solve using structure of model and maybe in parallel
src/ClpSolve.cpp:4830
↓ 1 callersMethodsolveBenders
Solve using Benders decomposition and maybe in parallel
src/ClpSolve.cpp:6127
↓ 1 callersMethodsolveKKT
Uses factorization to solve. - given as if KKT. region1 is rows+columns, region2 is rows */
src/ClpCholeskyBase.cpp:212
↓ 1 callersFunctionsolveMany
src/AbcSimplex.cpp:1595
↓ 1 callersFunctionsolveSmall
src/IdiSolve.cpp:19
↓ 1 callersMethodsortBlocks
Sort blocks */
src/ClpPackedMatrix.cpp:7353
↓ 1 callersMethodspace
Returns space needed */
src/ClpCholeskyDense.cpp:150
↓ 1 callersMethodsparseFactorization
Sparsity on or off
src/ClpSimplex.cpp:5034
↓ 1 callersFunctionspecialOptions
For advanced options 1 - Don't keep changing infeasibility weight 2 - Keep nonLinearCost round solves 4 - Force outgoing va
src/ClpModel.hpp:1203
↓ 1 callersMethodspecialRowCopy
src/ClpPackedMatrix.cpp:5740
↓ 1 callersMethodstartColumnBlock
Start of each column block
src/AbcMatrix.hpp:381
↓ 1 callersMethodstartFastDual2
Start Fast dual
src/ClpSimplex.cpp:13024
↓ 1 callersMethodstartPermanentArrays
Start or reset using maximumRows_ and Columns_
src/ClpModel.cpp:4922
↓ 1 callersFunctionstatistics
src/ClpSolver.cpp:3102
↓ 1 callersFunctionstatistics
src/Attic/ClpSolver.cpp:3091
↓ 1 callersMethodstatusCopy
Return copy of status array (char[numberRows+numberColumns]), use delete [] */
src/ClpModel.cpp:3951
↓ 1 callersFunctionstatusExists
See if status (i.e. basis) array exists (partly for OsiClp)
src/ClpModel.hpp:901
↓ 1 callersMethodstatusOfProblem
Factorizes and returns true if optimal. Used by user */
src/ClpSimplex.cpp:9902
↓ 1 callersMethodstopFastDual2
Stop Fast dual
src/ClpSimplex.cpp:13302
↓ 1 callersMethodsymbolic
Does Symbolic factorization given permutation. This is called immediately after order. If user provides this then user must provide factorize a
src/ClpCholeskyUfl.cpp:274
↓ 1 callersMethodsynchronizeModel
define PRINT_CLP_CHANGES Synchronize Clp model - Int and Dbl
src/ClpParameters.cpp:370
↓ 1 callersFunctiontest_lapack
src/ClpMain.cpp:62
↓ 1 callersFunctiontest_lapack
src/Attic/ClpMain.cpp:59
↓ 1 callersFunctiontightenDoubletons2
src/ClpPresolve.cpp:486
↓ 1 callersMethodtightenPrimalBounds
Tightens primal bounds to make dual faster. Unless fixed, bounds are slightly looser than they could be. This is to make dual go faster and is
src/AbcSimplex.cpp:3002
↓ 1 callersFunctiontimeCompatibility
src/ClpPESimplex.hpp:121
↓ 1 callersMethodtimesModifyExcludingSlacks
Return <code>y + A * scalar *x</code> in <code>y</code>. @pre <code>x</code> must be of size <code>numColumns()</code> @pre <code>y</code> must
src/AbcMatrix.cpp:1034
↓ 1 callersMethodtransposeTimesBasic
Return y + A * scalar(+-1) *x</code> in <code>y</code>. @pre <code>x</code> must be of size <code>numRows()</code> @pre <code>y</code> must be
src/AbcMatrix.cpp:3507
↓ 1 callersMethodtransposeTimesByRow
Return <code>x * A + y</code> in <code>z</code>. Squashes small elements and knows about ClpSimplex */
src/ClpGubMatrix.cpp:786
↓ 1 callersMethodtransposeTimesByRow
Return <code>x * A + y</code> in <code>z</code>. Squashes small elements and knows about ClpSimplex */
src/ClpPlusMinusOneMatrix.cpp:671
↓ 1 callersMethodtransposeTimesByRow
Return <code>x * A in <code>z</code>. Squashes small elements and knows about ClpSimplex */
src/ClpPackedMatrix.cpp:1307
↓ 1 callersMethodunflag
Unflag all variables and return number unflagged
src/ClpSimplexPrimal.cpp:3204
↓ 1 callersMethodunmarkHotStart
src/OsiClp/OsiClpSolverInterface.cpp:3020
↓ 1 callersFunctionupdate
src/AbcDualRowDantzig.cpp:279
↓ 1 callersFunctionupdate
src/AbcDualRowSteepest.cpp:907
↓ 1 callersFunctionupdateColumnFTPart1
src/AbcSimplexFactorization.hpp:200
↓ 1 callersMethodupdateColumnForDebug
Updates one column (FTRAN) from region2 number returned is negative if no room region1 starts as zero and is zero at end */
src/ClpFactorization.cpp:930
↓ 1 callersMethodupdateCompatibleRows
Update the dual compatible rows */
src/ClpPESimplex.cpp:721
↓ 1 callersFunctionupdateDualsInDualBit
src/AbcSimplexDual.cpp:558
↓ 1 callersMethodupdatePivot
update information for a pivot (and effective rhs) */
src/ClpGubMatrix.cpp:3573
↓ 1 callersMethodupdatePrimalsInPrimal
The primals are updated by the given array. Returns number of infeasibilities. After rowArray will have list of cost changes */
src/ClpSimplexPrimal.cpp:2584
↓ 1 callersMethodupdateTwoColumnsTranspose
Updates two columns (BTRAN) from regionSparse2 and 3 regionSparse starts as zero and is zero at end Note - if regionSparse2 packed on input - w
src/ClpFactorization.cpp:1010
↓ 1 callersFunctionupdateWeights2
Actually updates weights
src/AbcDualRowDantzig.hpp:33
↓ 1 callersMethodupdateWeightsOnly
src/AbcDualRowSteepest.cpp:761
↓ 1 callersFunctionupdate_model
src/ClpPresolve.cpp:2004
↓ 1 callersMethodupperTheta
upper theta from dual column
src/AbcSimplex.hpp:520
↓ 1 callersFunctionusage
src/unitTest.cpp:261
↓ 1 callersMethodusefulInfo
Returns true if copy has useful information
src/AbcMatrix.hpp:550
↓ 1 callersFunctionwhichChar
src/ClpModel.cpp:4022
↓ 1 callersMethodwhileIterating
Reasons to come out: -1 iterations etc -2 inaccuracy -3 slight inaccuracy (and done iterations) +0 looks optimal (might be unbounded - but
src/ClpSimplexDual.cpp:973
↓ 1 callersMethodwhileIteratingParallel
src/AbcSimplexParallel.cpp:1332
↓ 1 callersMethodwriteLp
Write the problem into an Lp file of the given filename. If objSense is non zero then -1.0 forces the code to write a maximization objective and
src/ClpSimplex.cpp:8129
↓ 1 callersMethodwriteLp
Write the problem into an Lp file of the given filename. If objSense is non zero then -1.0 forces the code to write a maximization objective and
src/OsiClp/OsiClpSolverInterface.cpp:6365
↓ 1 callersMethodzap
Zaps stuff 1 - arrays, 2 ints, 3 both
src/ClpNode.cpp:808
↓ 1 callersFunctionzeroSmall
How much we want to zero small values from aggregation - ratio 0 - 1.0e-12, 1 1.0e-11, 2 1.0e-10, 3 1.0e-9 */
src/ClpPresolve.hpp:265
↓ 1 callersFunctionzeroTolerance
Zero tolerance
src/ClpFactorization.hpp:211
↓ 1 callersFunctionzeros
Are there zeros?
src/ClpPackedMatrix.hpp:332
FunctionATOI
A lazy way to restrict which transformations are applied during debugging.
src/ClpPresolve.cpp:386
MethodAbcDualRowDantzig
------------------------------------------------------------------- Default Constructor --------------------------------------------------------------
src/AbcDualRowDantzig.cpp:22
MethodAbcDualRowPivot
------------------------------------------------------------------- Default Constructor --------------------------------------------------------------
src/AbcDualRowPivot.cpp:16
MethodAbcDualRowSteepest
############################################################################ Constructors / Destructor / Assignment ##################################
src/AbcDualRowSteepest.cpp:21
MethodAbcMatrix
------------------------------------------------------------------- Default Constructor --------------------------------------------------------------
src/AbcMatrix.cpp:36
MethodAbcNonLinearCost
------------------------------------------------------------------- Default Constructor --------------------------------------------------------------
src/AbcNonLinearCost.cpp:21
MethodAbcPrimalColumnDantzig
------------------------------------------------------------------- Default Constructor --------------------------------------------------------------
src/AbcPrimalColumnDantzig.cpp:23
← previousnext →1,101–1,200 of 3,454, ranked by callers