XPRSstrongbranch
XPRSstrongbranch |
int XPRS_CC XPRSstrongbranch(XPRSprob prob, const int nbnds, const int mbndind[], const char cbndtype[], const double dbndval[], const int itrlimit, double dsobjval[], int msbstatus[]);
prob
|
The current problem.
|
||||||
nbnds
|
Number of bound changes to try.
|
||||||
mbndind
|
Integer array of size
nbnds containing the indices of the columns on which the bounds will change.
|
||||||
cbndtype
|
Character array of length
nbnds indicating the type of bound to change:
|
||||||
dbndval
|
Double array of length
nbnds giving the new bound values.
|
||||||
itrlimit
|
Maximum number of LP iterations to perform for each bound change.
|
||||||
dsobjval
|
Objective value of each LP after performing the strong branching iterations.
|
||||||
msbstatus
|
Status of each LP after performing the strong branching iterations, as detailed for the
LPSTATUS attribute.
|
int mbndind[] = { 0, 0, 1, 1 }; char cbndtype[] = "LULU"; double dbndval[] = {1, 0, 2, 1}; double dsobjval[4]; int msbstatus[4]; ... XPRSstrongbranch(prob, 4, mbndind, cbndtype, dbndval, 1000, dsobjval, msbstatus);
Prior to calling XPRSstrongbranch, the current LP problem must have been solved to optimality and an optimal basis must be available.
© 2001-2020 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.