coin-Bcp
BCP_enum.hpp
Go to the documentation of this file.
1 // Copyright (C) 2000, International Business Machines
2 // Corporation and others. All Rights Reserved.
3 #ifndef _BCP_ENUM_H
4 #define _BCP_ENUM_H
5 
6 // This file is fully docified.
7 
8 //-----------------------------------------------------------------------------
9 
22 };
23 
24 //-----------------------------------------------------------------------------
25 
40 };
41 
42 //-----------------------------------------------------------------------------
43 
56 };
57 
58 //-----------------------------------------------------------------------------
59 
74 };
75 
76 //-----------------------------------------------------------------------------
77 
95 };
96 
97 //-----------------------------------------------------------------------------
98 
123  BCP_ObjInactive = 0x10 // fixed for vars, free for cuts
124 };
125 
126 //-----------------------------------------------------------------------------
127 
141 };
142 
153 };
154 
155 //-----------------------------------------------------------------------------
156 
168 };
169 
170 //-----------------------------------------------------------------------------
171 
189 };
190 
191 //-----------------------------------------------------------------------------
192 
207 };
208 
226 };
227 
228 //-----------------------------------------------------------------------------
241 };
242 
243 //-----------------------------------------------------------------------------
262 };
263 
264 //-----------------------------------------------------------------------------
286 };
287 
288 #endif
Binary (0-1) variable.
Definition: BCP_enum.hpp:163
BCP_object_origin
This enumerative constant describes the origin (originating process) of an object (variable or cut)...
Definition: BCP_enum.hpp:249
The violation is the distance of the fractional point from the cut.
Definition: BCP_enum.hpp:36
Pack all dual variables.
Definition: BCP_enum.hpp:152
The data stored is with respect to the original description of the base problem (as was given by the ...
Definition: BCP_enum.hpp:94
The object cannot be branched on.
Definition: BCP_enum.hpp:111
Pack only those variables that are currently at nonzero levels.
Definition: BCP_enum.hpp:135
BCP_feasibility_test
This enumerative constant describes which built-in feasibility-testing routine should be invoked...
Definition: BCP_enum.hpp:217
Do not generate columns, but send back the node to the Tree Manager for processing in the next phase...
Definition: BCP_enum.hpp:70
The problem is feasible if all non-continuous variables are integral.
Definition: BCP_enum.hpp:225
BCP_dual_solution_description
This enumerative constant describes how the dual solution should be packed into a buffer if the defau...
Definition: BCP_enum.hpp:148
BCP_IneffectiveConstraints
This enumerative constant describes which constraints should be considered ineffective after solving ...
Definition: BCP_enum.hpp:177
Pack only those variables that are currently at fractional (i.e., non-integral) levels.
Definition: BCP_enum.hpp:138
The violation is the directional (in the direction of the objective distance of the fractional point ...
Definition: BCP_enum.hpp:39
BCP_slack_cut_discarding
This enumerative constant describes when to purge the slack cut pool (in the LP process).
Definition: BCP_enum.hpp:15
Purge the slack cuts at every iteration while processing search tree nodes.
Definition: BCP_enum.hpp:21
The two objects are the same.
Definition: BCP_enum.hpp:278
The object is to be removed next time when the formulation is compressed.
Definition: BCP_enum.hpp:119
No object type is given.
Definition: BCP_enum.hpp:55
The solution is not MIP feasible but the user was able to derive a MIP feasible solution from it (e...
Definition: BCP_enum.hpp:206
No data is stored.
Definition: BCP_enum.hpp:86
BCP_warmstart_info
This enumerative constant describes how warmstarting information should be passed from the end of a p...
Definition: BCP_enum.hpp:233
The object is not removable from the LP formulation, even if the object becomes inactive.
Definition: BCP_enum.hpp:115
BCP_CutViolationNorm
This enumerative constant describes how to compute the "violation" of a generated cut...
Definition: BCP_enum.hpp:31
Do not use any warmstart information.
Definition: BCP_enum.hpp:235
The problem is feasible if all primal variables take values 0 or 1.
Definition: BCP_enum.hpp:220
Constraints with dual variables at level zero are considered ineffective.
Definition: BCP_enum.hpp:188
BCP_obj_status
This enumerative constant gives the status of an object (variable or cut).
Definition: BCP_enum.hpp:105
The data stored is an explicit listing of values.
Definition: BCP_enum.hpp:88
Attempt column generation.
Definition: BCP_enum.hpp:73
The problem is feasible if all primal variables are integral.
Definition: BCP_enum.hpp:223
The solution is MIP feasible.
Definition: BCP_enum.hpp:202
The object was left over in the local variable or cut pool of the LP process from the previous iterat...
Definition: BCP_enum.hpp:252
Purge the slack cuts when the LP starts processing a new search tree node.
Definition: BCP_enum.hpp:18
Pack only those variables that are currently at nonzero levels.
Definition: BCP_enum.hpp:150
Use the warmstart info from the end of the parent in the children.
Definition: BCP_enum.hpp:240
No special information is given about the object.
Definition: BCP_enum.hpp:107
The data stored is with respect to the same kind of data in the parent of the search tree node...
Definition: BCP_enum.hpp:91
The object does not need to be sent to the variable/cut pool.
Definition: BCP_enum.hpp:109
BCP_feasibility
This enumerative constant describes the possible return codes of the function that tests MIP feasibil...
Definition: BCP_enum.hpp:198
The object is inactive.
Definition: BCP_enum.hpp:123
The object is from a variable or cut pool.
Definition: BCP_enum.hpp:259
Use the warmstart info from the end of the root in all search tree nodes.
Definition: BCP_enum.hpp:238
The two objects are comparable but the first object is better.
Definition: BCP_enum.hpp:280
Continuous variable.
Definition: BCP_enum.hpp:167
The object originates from a branching object.
Definition: BCP_enum.hpp:255
The object is from the Tree Manager.
Definition: BCP_enum.hpp:261
The violation is interpreted in the normal sense, i.e., max(0, max(lb-lhs, lhs-ub)) ...
Definition: BCP_enum.hpp:34
The object was generated by a variable or cut generator.
Definition: BCP_enum.hpp:257
Algorithmic object.
Definition: BCP_enum.hpp:53
BCP_primal_solution_description
This enumerative constant describes how the primal solution should be packed into a buffer if the def...
Definition: BCP_enum.hpp:133
Do fathom the node.
Definition: BCP_enum.hpp:67
The two objects are not comparable or neither is better than the other.
Definition: BCP_enum.hpp:285
Constraints with nonzero (primal) slack value are considered ineffective.
Definition: BCP_enum.hpp:183
BCP_column_generation
This enumerative constant describes what to do when a search tree node becomes fathomable for the cur...
Definition: BCP_enum.hpp:65
BCP_storage_t
This enumerative constant describes how to store certain data for a search tree node.
Definition: BCP_enum.hpp:84
Pack all primal variables.
Definition: BCP_enum.hpp:140
The two objects are comparable but the second object is better.
Definition: BCP_enum.hpp:282
BCP_object_t
This enumerative constant describes the possible types of objects (variables and cuts).
Definition: BCP_enum.hpp:49
Base object.
Definition: BCP_enum.hpp:51
The solution is not MIP feasible.
Definition: BCP_enum.hpp:200
General integer variable.
Definition: BCP_enum.hpp:165
BCP_object_compare_result
This enumerative constant describes the possible outcomes when comparing two objects (variables or cu...
Definition: BCP_enum.hpp:276
None of the constraints are ever considered ineffective.
Definition: BCP_enum.hpp:180
BCP_var_t
This enumerative constant describes the integrality type of a variable.
Definition: BCP_enum.hpp:161