3 #ifndef _BCP_LP_PARAM_H 4 #define _BCP_LP_PARAM_H Print the number of ineffective rows in the current problem.
**** This parameter is not used anywhere!!! ****
Print out a message when the default version of an overridable method is executed.
Print the number of variables generated before resolving the Lp ir fathoming a node.
Specifies the rule used for built-in branching object comparison (if the buit-in routine is used at a...
Maximum allowed running time.
Print the number of variables whose bounds have been changed by reduced cost fixing or logical fixing...
Print information if receiving variables is timed out.
Print information on the presolved branching candidates during strong branching.
This parameter specifies the time to wait for the first generated cut at iterations that are not the ...
If true the BCP will attempt to do reduced cost fixing only for variables currently at zero...
Just a marker for the last LpVerb.
What should be the "niceness" of the LP process.
After a branching object is selected print what happens to the presolved children (e...
Specifies how many branching variables with values close to half between two integers should be chose...
The number of non dual-feasible colums that can be added at a time to the formulation is a certain fr...
See the description of the previous parameter.
Print detailed information on the branching candidate selected by strong branching.
This parameter specifies the time to wait for cuts at the first LP relaxation at a search tree node...
<bf>Deprecated parameter.
**** This parameter is not used anywhere!!! ****
How many times in a row a constraint must be found ineffective before it is marked for deletion...
Print the number of variables added from the local variable pool in the curent iteration.
The slack cut discarding strategy used in the default version of the function purge_slack_pool().
Print the "Starting iteration x" line.
str_array_params
There are no string array parameters.
Specifies the rule used for selecting one of the children of the search tree node for diving...
Print detailed information about all the branching candidates during strong branching.
Print information if receiving cuts is timed out.
This parameter specifies the time to wait for variables at iterations that are not the first at a sea...
Upper limit on the number of iterations performed in each of the children of the search tree node whe...
If true then the LP process will check each newly arrived variable whether it already exists in the l...
This parameter specifies the time to wait for the first generated variable at iterations that are not...
Print the number of variables generated during this iteration.
For each tree node print out how much time was spent on it.
The fraction of rows that must be marked for deletion before matrix compression can occur...
Whether to send back the description of fathomed search tree nodes to the Tree Manager.
If true the BCP will attempt to do reduced cost fixing for any variable, no matter what is their curr...
The Variable Pool is queried for columns that improve the formulation after the first LP realxation i...
The Cut Pool is queried for violated valid inequalities after the first LP relaxation is solved and t...
Indicates how matrix scaling should be performed.
A cut has to remain effective through this many iterations in the LP before it is sent to the Cut Poo...
Whether we should refrain from compressing the problem description right before a fathomed node's des...
The number of columns that must be marked for deletion before matrix compression can occur...
This parameter specifies the time to wait for cuts at iterations that are not the first at a search t...
Print the number of cuts sent from the LP to the cut pool.
If true, BCP supports branching on cuts by providing potential branching candidates for the user...
Turn on the user hook "display_lp_solution".
The filename all the output should go to.
The maximum number of violated but not added cuts to be kept from one iteration to the next...
chr_params
Character parameters.
Values not further from an integer value than the value of this parameter are considered to be intege...
If true then the LP process will check each newly received cut whether it already exists in the local...
Indicates what part of the primal solution is sent to the Cut Generator process if the BCP_lp_user::p...
Indicates what part of the dual solution is sent to the Variable Generator process if the BCP_lp_user...
dbl_params
Double parameters.
Just a marker for the first LpVerb.
The number of non dual-feasible colums that can be added to the formulation at a time cannot exceed t...
Print the number of columns and rows that were deleted during matrix compression. ...
The number of rows that must be marked for deletion before matrix compression can occur...
Specifies how warmstart information should be stored in the TM.
Print information on the branching candidate selected by strong branching.
int_params
Integer parameters.
str_params
String parameters.
Print the number of cuts generated during this iteration (since the LP was resolved last time)...
This and the following three parameters control how long the LP process waits for generated variables...
Similar as above for variables.
Indicates which constraints should be considered ineffective.
Print the "Processing NODE x on LEVEL y" line.
The maximum number of violated valid inequalities that can be added per iteration.
How cut violation should be computed.
**** This parameter is not used anywhere!!! ****
The minimum difference between the objective value of any two feasible solution (with different objec...
The fraction of columns that must be marked for deletion before matrix compression can occur...
Print the current number of cuts in the cut pool.
This parameter specifies the time to wait for variables at the first LP relaxation at a search tree n...
Print the size of the problem matrix and the LP solution value after resolving the LP...
Print information related to fathoming.
The maximum number of variables that can be added per iteration.
The maximum fraction of the violated but not added cuts to be kept from one iteration to the next...
Turn on the user hook "display_lp_solution" for the last LP relaxation solved at a search tree node...
Print the number of cuts added from the local cut pool in the current iteration.
This and the following three parameters control how long the LP process waits for generated cuts...
Parameters used in the LP process.
Indicates whether message passing is serial (all processes are on the same processor) or not...
Specifies which built-in MIP feasibility testing routine should be invoked (if a buit-in routine is u...