6 #ifndef _ClpParameters_H
7 #define _ClpParameters_H
86 memcpy(reinterpret_cast< void * >(newArray), array, size *
sizeof(T));
94 for (i = 0; i < size; i++)
102 T *arrayNew =
new T[size];
116 T *arrayNew =
new T[size];
The maximum amount the primal constraints can be violated and still be considered feasible...
void ClpFillN(T *array, const CoinBigIndex size, T value)
And set.
The maximum number of iterations Clp can execute in the simplex methods.
ClpIntParam
This is where to put any useful stuff.
For a structure to be used by trusted code.
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.
Just a marker, so that we can allocate a static sized array to store parameters.
Objective function constant.
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.
void ClpDisjointCopyN(const T *array, const CoinBigIndex size, T *newArray)
Copy (I don't like complexity of Coin version)
Tolerance to use in presolve.
Just a marker, so that we can allocate a static sized array to store parameters.
T * ClpCopyOfArray(const T *array, const CoinBigIndex size, T value)
This returns a non const array filled with input from scalar or actual array.