Go to the documentation of this file.
6 #ifndef _ClpParameters_H
7 #define _ClpParameters_H
86 memcpy(reinterpret_cast< void * >(newArray), array, size *
sizeof(T));
91 ClpFillN(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];
Objective function constant.
T * ClpCopyOfArray(const T *array, const CoinBigIndex size, T value)
This returns a non const array filled with input from scalar or actual array.
For a structure to be used by trusted code.
Just a marker, so that we can allocate a static sized array to store parameters.
Tolerance to use in presolve.
void ClpDisjointCopyN(const T *array, const CoinBigIndex size, T *newArray)
Copy (I don't like complexity of Coin version)
Just a marker, so that we can allocate a static sized array to store parameters.
Maximum wallclock running time in seconds - after, this action is as max iterations.
The maximum number of iterations Clp can execute in hotstart before terminating.
The maximum amount the primal constraints can be violated and still be considered feasible.
ClpIntParam
This is where to put any useful stuff.
The maximum number of iterations Clp can execute in the simplex methods.
Maximum time in seconds - after, this action is as max iterations.
The name discipline; specifies how the solver will handle row and column names.
Set Dual objective limit.
The maximum amount the dual constraints can be violated and still be considered feasible.
void ClpFillN(T *array, const CoinBigIndex size, T value)
And set.
Just a marker, so that we can allocate a static sized array to store parameters.