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

↓ 13 callersMethodisColOrdered

Whether the packed matrix is column major ordered or not. */

src/AbcMatrix.hpp:32

↓ 13 callersMethodlastPivotRow

Current/last pivot row (set after END of choosing pivot row in dual)

src/AbcSimplex.hpp:738

↓ 13 callersMethodmodifyObjective

Modify objective e.g. if dual infeasible in dual

src/ClpSolve.cpp:4699

↓ 13 callersMethodreplaceMatrix

Replace Clp Matrix (current is not deleted)

src/ClpModel.cpp:4046

↓ 13 callersMethodsetDualTolerance

src/ClpModel.cpp:244

↓ 13 callersFunctionsetOriginalStatus

src/AbcNonLinearCost.hpp:50

↓ 13 callersMethodstartCheck

Start check at beginning of whileIterating

src/ClpSolve.cpp:4715

↓ 13 callersFunctionupdateColumn

Updates one column (FTRAN) */

src/AbcSimplexFactorization.hpp:218

↓ 13 callersFunctionweight

src/ClpGubMatrix.hpp:250

↓ 12 callersMethodeventWithInfo

This can do whatever it likes. Return code -1 means no action. This passes in something */

src/ClpEventHandler.cpp:73

↓ 12 callersMethodgetIntParam

src/OsiClp/OsiClpSolverInterface.cpp:1794

↓ 12 callersFunctiongetNumRows

Get number of rows

src/OsiClp/OsiClpSolverInterface.hpp:379

↓ 12 callersFunctioninDoubleArray

src/ClpSimplex.cpp:7359

↓ 12 callersMethodinfeasibilityRay

Infeasibility/unbounded ray (NULL returned if none/wrong)

src/ClpModel.cpp:2765

↓ 12 callersMethodinternalStatus

src/AbcSimplex.hpp:663

↓ 12 callersFunctionmaximumPivots

Maximum number of pivots between factorizations

src/ClpFactorization.hpp:173

↓ 12 callersMethodmessageLevel

src/CoinAbcBaseFactorization4.cpp:4497

↓ 12 callersMethodreverseOrderedCopy

Returns a new matrix in reverse order without gaps */

src/AbcMatrix.cpp:288

↓ 12 callersMethodrhsOffset

Returns effective RHS if it is being used. This is used for long problems or big gub or anywhere where going through full columns is expensive.

src/ClpGubMatrix.cpp:3443

↓ 12 callersMethodsetColumnLower

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

src/ClpModel.cpp:592

↓ 12 callersMethodsetColumnUpper

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

src/ClpModel.cpp:608

↓ 12 callersMethodsetDoubleValue

src/Attic/ClpParam.cpp:368

↓ 12 callersMethodsolutionBasic

src/AbcSimplex.hpp:633

↓ 12 callersMethodstepLength

Returns step length which gives minimum of objective for solution + theta * change vector up to maximum theta. arrays are numberColumns+numberR

src/ClpLinearObjective.cpp:174

↓ 12 callersMethodwriteBasis

Write the basis in MPS format to the specified file. If writeValues true writes values of structurals (and adds VALUES to end of NAME card)

src/ClpSimplex.cpp:6569

↓ 11 callersMethodcomputeObjectiveValue

Compute objective value from solution

src/ClpSimplex.cpp:11324

↓ 11 callersMethodcreateEmptyMatrix

Create empty ClpPackedMatrix

src/ClpModel.cpp:1205

↓ 11 callersMethoddefaultFactorizationFrequency

If user left factorization frequency then compute

src/ClpSimplex.cpp:11401

↓ 11 callersMethodgetColSolution

Get pointer to array[getNumCols()] of primal solution vector

src/OsiClp/OsiClpSolverInterface.cpp:6502

↓ 11 callersMethodgetColumnName

Return name or Cnnnnnnn

src/ClpModel.cpp:4268

↓ 11 callersMethodgoSparse

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

src/ClpFactorization.cpp:1038

↓ 11 callersMethodhitMaximumIterations

Returns true if hit maximum iterations (or time)

src/ClpModel.cpp:2809

↓ 11 callersMethodnumberTotal

Number of variables (includes spare rows)

src/AbcSimplex.hpp:232

↓ 11 callersMethodsetObjective

src/ClpModel.cpp:4004

↓ 11 callersFunctiontestingMessage

Display message on stdout and stderr

src/unitTest.cpp:1398

↓ 11 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/ClpSimplex.cpp:5115

↓ 11 callersMethodunrollWeights

src/ClpDualRowPivot.cpp:58

↓ 11 callersFunctionwhichDouble

Returns resized array and updates size

src/ClpModel.cpp:4011

↓ 11 callersMethodwriteMps

src/OsiClp/OsiClpSolverInterface.cpp:5051

↓ 10 callersMethodaddColumn

src/ClpModel.cpp:2226

↓ 10 callersMethodcopyInIntegerInformation

src/ClpModel.cpp:3884

↓ 10 callersMethodcorrectSequence

Correct sequence in and out to give true value

src/ClpGubMatrix.cpp:4009

↓ 10 callersMethoddualExpanded

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

src/ClpGubMatrix.cpp:2186

↓ 10 callersFunctiongetColLower

Get pointer to array[getNumCols()] of column lower bounds

src/OsiClp/OsiClpSolverInterface.hpp:405

↓ 10 callersFunctiongetColUpper

Get pointer to array[getNumCols()] of column upper bounds

src/OsiClp/OsiClpSolverInterface.hpp:408

↓ 10 callersFunctiongetIntParam

Get an integer parameter

src/ClpModel.hpp:1132

↓ 10 callersFunctionlogLevel

src/ClpModel.hpp:1007

↓ 10 callersFunctionoptimizationDirection

Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore

src/ClpModel.hpp:504

↓ 10 callersMethodresize

src/ClpModel.cpp:1230

↓ 10 callersFunctionsetActive

To say row active in primal pivot row choice

src/ClpSimplex.hpp:1563

↓ 10 callersFunctionsetColUpper

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

src/ClpModel.hpp:614

↓ 10 callersFunctionsetInfeasible

src/ClpNonLinearCost.hpp:358

↓ 10 callersFunctionsetLogLevel

src/Idiot.hpp:196

↓ 10 callersMethodsetSequenceIn

Set sequenceIn or Out */

src/AbcSimplex.hpp:703

↓ 10 callersMethodsolution

Return row or column values

src/AbcSimplex.hpp:802

↓ 10 callersFunctionsolve

examples/ekk_interface.cpp:119

↓ 9 callersFunctionClpFillN

src/ClpModelParameters.hpp:90

↓ 9 callersFunctionclearFlagged

src/ClpSimplex.hpp:1554

↓ 9 callersFunctionclearPivoted

src/ClpSimplex.hpp:1544

↓ 9 callersFunctioncomplementarityGap

ComplementarityGap

src/ClpInterior.hpp:253

↓ 9 callersMethoddeleteCols

Delete the columns whose indices are listed in <code>indDel</code>. */

src/ClpDummyMatrix.cpp:233

↓ 9 callersFunctiondeleteDouble

Returns resized array and updates size

src/ClpModel.cpp:1144

↓ 9 callersFunctiondualFeasible

If problem is dual feasible

src/ClpSimplex.hpp:670

↓ 9 callersMethoddualRowPivot

dual row pivot choice

src/AbcSimplex.hpp:319

↓ 9 callersMethodfactorize

Factorizes using current basis. This is for external use Return codes are as from ClpFactorization

src/ClpSimplex.cpp:1481

↓ 9 callersMethodfeasibleReportCost

Feasible cost with offset and direction (i.e. for reporting)

src/ClpNonLinearCost.cpp:2015

↓ 9 callersMethodgotRowCopy

src/AbcMatrix.hpp:390

↓ 9 callersFunctionindexError

For errors to make sure print to screen only called in debug mode

src/AbcSimplex.cpp:4535

↓ 9 callersFunctionmessageHandler

src/ClpModel.hpp:971

↓ 9 callersMethodmutexPointer

For waking up thread

src/AbcSimplex.hpp:1033

↓ 9 callersMethodoriginalColumns

return pointer to original columns

src/ClpPresolve.cpp:367

↓ 9 callersMethodpassInEventHandler

Pass in Event handler (cloned and deleted at end)

src/ClpModel.cpp:4712

↓ 9 callersFunctionresizeArray

src/AbcSimplex.cpp:286

↓ 9 callersFunctionresizeDouble

Useful routines Returns resized array and deletes incoming

src/ClpModel.cpp:1128

↓ 9 callersFunctionrunTest

test/test_racing_lp.cpp:522

↓ 9 callersFunctionsetColLower

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

src/ClpModel.hpp:608

↓ 9 callersMethodsetCurrentDualTolerance

src/AbcSimplex.hpp:279

↓ 9 callersFunctionsetFeasible

To say key is feasible

src/ClpGubMatrix.hpp:237

↓ 9 callersMethodsetMaximumSeconds

src/ClpModel.cpp:2794

↓ 9 callersMethodsetOsiModel

src/OsiClp/OsiClpSolverInterface.cpp:11087

↓ 9 callersFunctionsetupForSolve

shortName - 0 no , 1 yes

src/unitTest.cpp:92

↓ 9 callersMethodupdateColumn

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:845

↓ 9 callersFunctionuserChoiceValid1

Returns true if variable sequenceOut can leave basis when model->sequenceIn() enters. This function may be entered several times for each sequen

src/ClpSolver.hpp:120

↓ 8 callersFunctionClpCopyToMiniSave

src/ClpSimplexOther.cpp:8900

↓ 8 callersMethodafterCrunch

After very cursory presolve. rhs is numberRows, whichRows is 3*numberRows and whichColumns is 2*numberColumns. */

src/ClpSimplexOther.cpp:2312

↓ 8 callersFunctioncheck_sol

src/ClpPresolve.cpp:410

↓ 8 callersFunctionclearActive

src/ClpSimplex.hpp:1567

↓ 8 callersMethodclearArrays

Clears an array and says available (-1 does all)

src/AbcSimplex.cpp:5976

↓ 8 callersMethodcreateArrays

Create odd arrays

src/ClpNode.cpp:525

↓ 8 callersMethodcurrentAcceptablePivot

Acceptable pivot for this iteration

src/AbcSimplex.hpp:758

↓ 8 callersMethodfreeSequenceIn

Free chosen vector

src/AbcSimplex.hpp:753

↓ 8 callersFunctionfromLongArray

From a work array and dis-associate vector

src/CoinAbcBaseFactorization.hpp:376

↓ 8 callersMethodgetRowName

Return name or Rnnnnnnn

src/ClpModel.cpp:4232

↓ 8 callersMethodisInteger

Return true if the index-th variable is an integer variable */

src/ClpModel.cpp:3921

↓ 8 callersMethodloadQuadraticObjective

Load up quadratic objective

src/ClpModel.cpp:3969

↓ 8 callersFunctionlowerRegion

src/ClpSimplex.hpp:1170

↓ 8 callersFunctionmainTest

src/unitTest.cpp:286

↓ 8 callersMethodmode

@name gets and sets */ @{ Mode

src/AbcPrimalColumnSteepest.hpp:97

↓ 8 callersFunctionmoveAndZero

src/ClpSimplexDual.cpp:3592

↓ 8 callersMethodnearest

Returns nearest bound

src/ClpNonLinearCost.cpp:1972

← previous next →201–300 of 3,454, ranked by callers