6 #ifndef _ClpParameters_H
7 #define _ClpParameters_H
83 template <
class T>
inline void
86 memcpy(reinterpret_cast<void *> (newArray), array, size *
sizeof(T));
89 template <
class T>
inline void
93 for (i = 0; i < size; i++)
97 template <
class T>
inline T*
100 T * arrayNew =
new T[size];
109 template <
class T>
inline T*
113 T * arrayNew =
new T[size];
Maximum wallclock running time in seconds - after, this action is as max iterations.
T * ClpCopyOfArray(const T *array, const int 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.
The maximum amount the primal constraints can be violated and still be considered feasible...
Just a marker, so that we can allocate a static sized array to store parameters.
Just a marker, so that we can allocate a static sized array to store parameters.
void ClpDisjointCopyN(const T *array, const int size, T *newArray)
Copy (I don't like complexity of Coin version)
ClpIntParam
This is where to put any useful stuff.
void ClpFillN(T *array, const int size, T value)
And set.
Just a marker, so that we can allocate a static sized array to store parameters.
Set Dual objective limit.
The maximum amount the dual constraints can be violated and still be considered feasible.
The name discipline; specifies how the solver will handle row and column names.
The maximum number of iterations Clp can execute in hotstart before terminating.
Maximum time in seconds - after, this action is as max iterations.
Objective function constant.
The maximum number of iterations Clp can execute in the simplex methods.
Tolerance to use in presolve.