6#ifndef _ClpParameters_H
7#define _ClpParameters_H
86 memcpy(
reinterpret_cast< void *
>(newArray), array, size *
sizeof(T));
91ClpFillN(T *array,
const CoinBigIndex size, T value)
94 for (i = 0; i < size; i++)
102 T *arrayNew =
new T[size];
116 T *arrayNew =
new T[size];
void ClpFillN(T *array, const CoinBigIndex size, T value)
And set.
T * ClpCopyOfArray(const T *array, const CoinBigIndex size, T value)
This returns a non const array filled with input from scalar or actual array.
ClpIntParam
This is where to put any useful stuff.
@ ClpMaxNumIterationHotStart
The maximum number of iterations Clp can execute in hotstart before terminating.
@ ClpNameDiscipline
The name discipline; specifies how the solver will handle row and column names.
@ ClpMaxNumIteration
The maximum number of iterations Clp can execute in the simplex methods.
@ ClpLastIntParam
Just a marker, so that we can allocate a static sized array to store parameters.
@ ClpLastStrParam
Just a marker, so that we can allocate a static sized array to store parameters.
@ ClpProbName
Name of the problem.
@ ClpPresolveTolerance
Tolerance to use in presolve.
@ ClpDualTolerance
The maximum amount the dual constraints can be violated and still be considered feasible.
@ ClpPrimalObjectiveLimit
Primal objective limit.
@ ClpMaxSeconds
Maximum time in seconds - after, this action is as max iterations.
@ ClpDualObjectiveLimit
Set Dual objective limit.
@ ClpLastDblParam
Just a marker, so that we can allocate a static sized array to store parameters.
@ ClpPrimalTolerance
The maximum amount the primal constraints can be violated and still be considered feasible.
@ ClpObjOffset
Objective function constant.
@ ClpMaxWallSeconds
Maximum wallclock running time in seconds - after, this action is as max iterations.
void ClpDisjointCopyN(const T *array, const CoinBigIndex size, T *newArray)
Copy (I don't like complexity of Coin version)
For a structure to be used by trusted code.