BCP_object_compare_result
This enumerative constant describes the possible outcomes when comparing two objects (variables or cu...
@ BCP_SecondObjIsBetter
The two objects are comparable but the second object is better.
@ BCP_DifferentObjs
The two objects are not comparable or neither is better than the other.
@ BCP_FirstObjIsBetter
The two objects are comparable but the first object is better.
@ BCP_ObjsAreSame
The two objects are the same.
BCP_primal_solution_description
This enumerative constant describes how the primal solution should be packed into a buffer if the def...
@ BCP_PrimalSolution_Full
Pack all primal variables.
@ BCP_PrimalSolution_Fractions
Pack only those variables that are currently at fractional (i.e., non-integral) levels.
@ BCP_PrimalSolution_Nonzeros
Pack only those variables that are currently at nonzero levels.
BCP_object_origin
This enumerative constant describes the origin (originating process) of an object (variable or cut).
@ BCP_Object_Branching
The object originates from a branching object.
@ BCP_Object_FromPool
The object is from a variable or cut pool.
@ BCP_Object_Leftover
The object was left over in the local variable or cut pool of the LP process from the previous iterat...
@ BCP_Object_FromGenerator
The object was generated by a variable or cut generator.
@ BCP_Object_FromTreeManager
The object is from the Tree Manager.
BCP_storage_t
This enumerative constant describes how to store certain data for a search tree node.
@ BCP_Storage_NoData
No data is stored.
@ BCP_Storage_Explicit
The data stored is an explicit listing of values.
@ BCP_Storage_WrtCore
The data stored is with respect to the original description of the base problem (as was given by the ...
@ BCP_Storage_WrtParent
The data stored is with respect to the same kind of data in the parent of the search tree node.
BCP_dual_solution_description
This enumerative constant describes how the dual solution should be packed into a buffer if the defau...
@ BCP_DualSolution_Full
Pack all dual variables.
@ BCP_DualSolution_Nonzeros
Pack only those variables that are currently at nonzero levels.
BCP_feasibility_test
This enumerative constant describes which built-in feasibility-testing routine should be invoked.
@ BCP_Integral_Feasible
The problem is feasible if all primal variables are integral.
@ BCP_Binary_Feasible
The problem is feasible if all primal variables take values 0 or 1.
@ BCP_FullTest_Feasible
The problem is feasible if all non-continuous variables are integral.
BCP_feasibility
This enumerative constant describes the possible return codes of the function that tests MIP feasibil...
@ BCP_NotFeasible
The solution is not MIP feasible.
@ BCP_HeuristicFeasible
The solution is not MIP feasible but the user was able to derive a MIP feasible solution from it (e....
@ BCP_Feasible
The solution is MIP feasible.
BCP_CutViolationNorm
This enumerative constant describes how to compute the "violation" of a generated cut.
@ BCP_CutViolationNorm_Directional
The violation is the directional (in the direction of the objective distance of the fractional point ...
@ BCP_CutViolationNorm_Plain
The violation is interpreted in the normal sense, i.e., max(0, max(lb-lhs, lhs-ub))
@ BCP_CutViolationNorm_Distance
The violation is the distance of the fractional point from the cut.
BCP_obj_status
This enumerative constant gives the status of an object (variable or cut).
@ BCP_ObjCannotBeBranchedOn
The object cannot be branched on.
@ BCP_ObjToBeRemoved
The object is to be removed next time when the formulation is compressed.
@ BCP_ObjNoInfo
No special information is given about the object.
@ BCP_ObjDoNotSendToPool
The object does not need to be sent to the variable/cut pool.
@ BCP_ObjNotRemovable
The object is not removable from the LP formulation, even if the object becomes inactive.
@ BCP_ObjInactive
The object is inactive.
BCP_column_generation
This enumerative constant describes what to do when a search tree node becomes fathomable for the cur...
@ BCP_DoNotGenerateColumns_Fathom
Do fathom the node.
@ BCP_GenerateColumns
Attempt column generation.
@ BCP_DoNotGenerateColumns_Send
Do not generate columns, but send back the node to the Tree Manager for processing in the next phase.
BCP_object_t
This enumerative constant describes the possible types of objects (variables and cuts).
@ BCP_NoObj
No object type is given.
@ BCP_CoreObj
Base object.
@ BCP_AlgoObj
Algorithmic object.
BCP_warmstart_info
This enumerative constant describes how warmstarting information should be passed from the end of a p...
@ BCP_WarmstartNone
Do not use any warmstart information.
@ BCP_WarmstartRoot
Use the warmstart info from the end of the root in all search tree nodes.
@ BCP_WarmstartParent
Use the warmstart info from the end of the parent in the children.
BCP_IneffectiveConstraints
This enumerative constant describes which constraints should be considered ineffective after solving ...
@ BCP_IneffConstr_NonzeroSlack
Constraints with nonzero (primal) slack value are considered ineffective.
@ BCP_IneffConstr_ZeroDualValue
Constraints with dual variables at level zero are considered ineffective.
@ BCP_IneffConstr_None
None of the constraints are ever considered ineffective.
BCP_var_t
This enumerative constant describes the integrality type of a variable.
@ BCP_IntegerVar
General integer variable.
@ BCP_ContinuousVar
Continuous variable.
@ BCP_BinaryVar
Binary (0-1) variable.
BCP_slack_cut_discarding
This enumerative constant describes when to purge the slack cut pool (in the LP process).
@ BCP_DiscardSlackCutsAtNewIteration
Purge the slack cuts at every iteration while processing search tree nodes.
@ BCP_DiscardSlackCutsAtNewNode
Purge the slack cuts when the LP starts processing a new search tree node.