Cbc  2.9.9
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
ClpParameters.hpp
Go to the documentation of this file.
1 /* $Id: ClpParameters.hpp 2046 2014-08-14 04:13:10Z tkr $ */
2 // Copyright (C) 2000, 2002, International Business Machines
3 // Corporation and others. All Rights Reserved.
4 // This code is licensed under the terms of the Eclipse Public License (EPL).
5 
6 #ifndef _ClpParameters_H
7 #define _ClpParameters_H
8 
41 };
42 
70 };
71 
72 
80 };
81 
83 template <class T> inline void
84 ClpDisjointCopyN( const T * array, const int size, T * newArray)
85 {
86  memcpy(reinterpret_cast<void *> (newArray), array, size * sizeof(T));
87 }
89 template <class T> inline void
90 ClpFillN( T * array, const int size, T value)
91 {
92  int i;
93  for (i = 0; i < size; i++)
94  array[i] = value;
95 }
97 template <class T> inline T*
98 ClpCopyOfArray( const T * array, const int size, T value)
99 {
100  T * arrayNew = new T[size];
101  if (array)
102  ClpDisjointCopyN(array, size, arrayNew);
103  else
104  ClpFillN ( arrayNew, size, value);
105  return arrayNew;
106 }
107 
109 template <class T> inline T*
110 ClpCopyOfArray( const T * array, const int size)
111 {
112  if (array) {
113  T * arrayNew = new T[size];
114  ClpDisjointCopyN(array, size, arrayNew);
115  return arrayNew;
116  } else {
117  return NULL;
118  }
119 }
121 typedef struct {
122  int typeStruct; // allocated as 1,2 etc
123  int typeCall;
124  void * data;
126 #endif
The maximum amount the primal constraints can be violated and still be considered feasible...
The maximum number of iterations Clp can execute in the simplex methods.
ClpIntParam
This is where to put any useful stuff.
void ClpDisjointCopyN(const T *array, const int size, T *newArray)
Copy (I don&#39;t like complexity of Coin version)
ClpDblParam
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.
T * ClpCopyOfArray(const T *array, const int size, T value)
This returns a non const array filled with input from scalar or actual array.
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.
ClpStrParam
Objective function constant.
void ClpFillN(T *array, const int size, T value)
And set.
Primal objective limit.
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.
Name of the problem.
Tolerance to use in presolve.
Just a marker, so that we can allocate a static sized array to store parameters.