Initializing help system before first use

strongbranch

Purpose
Performs strong branching iterations on all specified bound changes.
For each candidate bound change, strongbranch 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
strongbranch(prob, nbounds, colind, bndtype, bndval, iterlim)
Arguments
prob 
The current problem.
nbounds 
Number of bound changes to try.
colind 
Integer array of size nbounds containing the indices of the columns on which the bounds will change.
bndtype 
Character array of length nbounds 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 
Double array of length nbounds giving the new bound values.
iterlim 
Maximum number of LP iterations to perform for each bound change.
Return value
A list with the following elements:
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.
Further information
Please refer to the C documentation for more details.

© 2001-2024 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.