Clp  1.15.5
 All Classes Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
ClpParameters.hpp
Go to the documentation of this file.
1 /* $Id: ClpParameters.hpp 1665 2011-01-04 17:55:54Z lou $ */
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 
68 };
69 
70 
78 };
79 
81 template <class T> inline void
82 ClpDisjointCopyN( const T * array, const int size, T * newArray)
83 {
84  memcpy(reinterpret_cast<void *> (newArray), array, size * sizeof(T));
85 }
87 template <class T> inline void
88 ClpFillN( T * array, const int size, T value)
89 {
90  int i;
91  for (i = 0; i < size; i++)
92  array[i] = value;
93 }
95 template <class T> inline T*
96 ClpCopyOfArray( const T * array, const int size, T value)
97 {
98  T * arrayNew = new T[size];
99  if (array)
100  ClpDisjointCopyN(array, size, arrayNew);
101  else
102  ClpFillN ( arrayNew, size, value);
103  return arrayNew;
104 }
105 
107 template <class T> inline T*
108 ClpCopyOfArray( const T * array, const int size)
109 {
110  if (array) {
111  T * arrayNew = new T[size];
112  ClpDisjointCopyN(array, size, arrayNew);
113  return arrayNew;
114  } else {
115  return NULL;
116  }
117 }
119 typedef struct {
120  int typeStruct; // allocated as 1,2 etc
121  int typeCall;
122  void * data;
124 #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'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.
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.