Dip-All
0.91.0
|
Go to the source code of this file.
Macros | |
#define | COINLIBAPI |
This has #defines etc for the "C" interface to Coin. More... | |
#define | COINLINKAGE_CB |
Constructors and destructor | |
This is a "C" interface to Cbc. The user does not need to know structure of Cbc_Model. | |
#define | COINLINKAGE |
Cbc_Model Destructor. More... | |
Typedefs | |
typedef void | Clp_Simplex |
User does not need to see structure of model but C++ code does. More... | |
typedef int | msgno |
typedef int int | ndouble |
typedef int int const double * | dvec |
typedef int int const double int | nint |
typedef int int const double int const int * | ivec |
typedef int int const double int const int int | nchar |
typedef int int const double int const int int char ** | cvec |
typedef void | Sbb_Model |
User does not need to see structure of model but C++ code does. More... | |
typedef void | Cbc_Model |
typedef int | CoinBigIndex |
Functions | |
typedef | void (COINLINKAGE_CB *clp_callback)(Clp_Simplex *model |
typedef for user call back. More... | |
#define COINLIBAPI |
This has #defines etc for the "C" interface to Coin.
If COIN_EXTERN_C defined then an extra extern C
Definition at line 43 of file Coin_C_defines.h.
COINLIBAPI int COINLINKAGE |
Cbc_Model Destructor.
Secondary status of problem -1 unset (status_ will also be -1) 0 search completed with solution 1 linear relaxation not feasible (or worse than cutoff) 2 stopped on gap 3 stopped on nodes 4 stopped on time 5 stopped on user event 6 stopped on solutions 7 linear relaxation unbounded 8 stopped on iteration limit.
Final status of problem Some of these can be found out by is......
Print the solution.
Number of nodes explored in B&B tree.
Best known bound on the optimal objective value.
Objective value of best feasible solution.
Best feasible solution vector.
"row" solution This is the vector A*x, where A is the constraint matrix and x is the current solution.
Is primal infeasiblity proven (for initialSolve) ?
Is optimality proven (for initialSolve) ?
Are there numerical difficulties (for initialSolve) ?
Solution limit reached?
Time limit reached?
Node limit reached?
Was continuous solution unbounded?
Is infeasiblity proven (or none better than cutoff)?
Is optimality proven?
Are there a numerical difficulties?
Number of iterations.
Just check solution (for external use) - sets sum of infeasibilities etc.
Number of primal infeasibilities.
Sum of primal infeasibilities.
Unset Callback function.
Set parameter "name" to value "value".
Return a copy of this model.
Print the model.
Set this variable to be integer.
Set this variable to be continuous.
Determine whether the ith variable is integer restricted.
Set the upper bound of a single variable.
Variable upper bounds.
Set the lower bound of a single variable.
Variable lower bounds.
Set the objective coefficient of a single variable.
Objective vector.
Set the upper bound of a single constraint.
Constraint upper bounds.
Set the lower bound of a single constraint.
Constraint lower bounds.
Direction of optimization (1 - minimize, -1 - maximize, 0 - ignore)
Number of variables in the model.
Number of constraints in the model.
Set the name of a row.
Set the name of a column.
Fill in first maxLength bytes of name array with a column name.
Fill in first maxLength bytes of name array with a row name.
Maximum lenght of a row or column name.
Coefficient vector of constraint matrix.
"Row index" vector of constraint matrix
"Column start" vector of constraint matrix.
Number of nonzero elements in constraint matrix.
Sets problem name.
Fills in array with problem name.
Provide an initial feasible solution to accelerate branch-and-bound Note that feasibility of the solution is not verified.
Write an mps file from the given filename.
Read an mps file from the given filename.
array
must be a null-terminated string.
Same format as Cbc_loadProblem()
Note that this translates directly to using "-name value" as a command-line argument to Cbc.
functions -1 before branchAndBound 0 finished - check isProvenOptimal or isProvenInfeasible to see if solution found (or check value of best solution) 1 stopped - on maxnodes, maxsols, maxtime 2 difficulties so run was abandoned (5 event user programmed event occurred)
Definition at line 45 of file Coin_C_defines.h.
#define COINLINKAGE_CB |
Definition at line 46 of file Coin_C_defines.h.
typedef void Clp_Simplex |
User does not need to see structure of model but C++ code does.
Definition at line 59 of file Coin_C_defines.h.
typedef int msgno |
Definition at line 65 of file Coin_C_defines.h.
typedef int int ndouble |
Definition at line 65 of file Coin_C_defines.h.
typedef int int const double * dvec |
Definition at line 65 of file Coin_C_defines.h.
typedef int int const double int nint |
Definition at line 65 of file Coin_C_defines.h.
typedef int int const double int const int * ivec |
Definition at line 65 of file Coin_C_defines.h.
typedef int int const double int const int int nchar |
Definition at line 65 of file Coin_C_defines.h.
typedef int int const double int const int int char ** cvec |
Definition at line 65 of file Coin_C_defines.h.
User does not need to see structure of model but C++ code does.
Definition at line 80 of file Coin_C_defines.h.
Definition at line 92 of file Coin_C_defines.h.
typedef int CoinBigIndex |
Definition at line 105 of file Coin_C_defines.h.
typedef void | ( | COINLINKAGE_CB * | sbb_callback | ) |
typedef for user call back.
The cvec are constructed so don't need to be const
Referenced by Coin::SmartPtr< T >::SmartPtr().