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