Initializing help system before first use

# problem.strongbranchcb

Purpose
This subroutine is deprecated and will be removed in a future release. Use problem.strongBranchCB instead.
Performs strong branching iterations on all specified bound changes. For each candidate bound change, strongbranchcb performs dual simplex iterations starting from the current optimal solution of the base LP, and returns both the status and objective value reached after these iterations.
Synopsis
`

problem.strongbranchcb(colind, bndtype, bndval, iterlim, objval, status, callback, data)

ret = callback(my_prob, my_object, ibnd)

`
Arguments

colind | Array containing the columns (i.e., xpress.var objects, indices, or names) on which the bounds will change.
bndtype | Character array indicating the type of bound to change:
U | indicates change the upper bound;
L | indicates change the lower bound;
B | indicates change both bounds, i.e., fix the column.
bndval | Array giving the new bound values.
iterlim | Maximum number of LP iterations to perform for each bound change.
objval | Objective value of each LP after performing the strong branching iterations.
status | Status of each LP after performing the strong branching iterations, as detailed for the LPSTATUS attribute.
callback | Function to be called after each strong branch has been reoptimized.
data | The user-defined object passed as my_object to callback.
ibnd | The index of bound for which callback is called.

Further information

Prior to calling strongbranchcb, the current LP problem must have been solved to optimality and an optimal basis must be available.

strongbranchcb is an extension to problem.strongBranch. If identical input arguments are provided both will return identical results, the difference being that for the case of PRSstrongbranchcb the sbnodecb function is called at the end of each LP reoptimization.

For each branch optimized, the LP can be interrogated: the LP status of the branch is available through checking LPSTATUS, and the objective function value is available through LPOBJVAL. It is possible to access the full current LP solution by using problem.getCallbackSolution.

Parent Topic Deprecated functionality

© 2001-2026 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.