Initializes a new instance of the CplexSolverConfiguration class.

Initializes a new instance of the CplexSolverConfiguration class.

Determines whether the specified Object is equal to the current Object.

Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.

Serves as a hash function for a particular type.

Gets the Type of the current instance.

Creates a shallow copy of the current Object.

Returns a String that represents the current Object.

This endpoint will be used to enable communication between solvers

Relative MIP optimality gap (MIP only). The MIP solver will terminate (with an optimal result) when the relative gap between the lower and upper objective bound is less than MIPGap times the upper bound.

Sets an absolute tolerance on the gap between the best integer objective and the objective of the best node remaining. When this difference falls below the value of this parameter, the mixed integer optimization is stopped.

This action is executed whenever a new best bound is found

This action is executed whenever a new incumbent is found

Influences the reduced-cost tolerance for optimality. This parameter governs how closely CPLEX must approach the theoretically optimal solution.

A method that decides if a partial problem should be created.

A method that sends partial problems over the wire

Sets the maximum time, in seconds, for a call to an optimizer. This time limit applies also to the conflict refiner. The time is measured in terms of either CPU time or elapsed time, according to the setting of the clock type parameter (CPX_PARAM_CLOCKTYPE, ClockType). The time limit for an optimizer applies to the sum of all its steps, such as preprocessing,crossover, and internal calls to other optimizers. In a sequence of calls to optimizers, the limit is not cumulative but applies to each call individually. For example, if you set a time limit of 10 seconds, and you call mipopt twice then there could be a total of (at most) 20 seconds of running time if each call consumes its maximum allotment.

Indicates if the solver should activate its provided HeuristicCallback This will make the solver use injected solutions from other solvers