Initializing help system before first use

# problem.loadCuts

Purpose
Loads cuts from the cut pool into the matrix. Without calling problem.loadCuts the cuts will remain in the cut pool but will not be active at the node. Cuts loaded at a node remain active at all descendant nodes unless they are deleted using problem.delCuts.
Topic areas
Data Input, Cuts, Optimizer
Synopsis
`problem.loadCuts(cutind, cuttype=0, interp=-1)`
Arguments

cutind: list[poolcut] | Array containing the cuts to be loaded into the matrix. These are objects returned by either problem.storeCuts or problem.getCPCutList.
cuttype: int | Cut type.
interp: int | The way in which the cut type is interpreted:
-1 | load all cuts;
1 | treat cut types as numbers;
2 | treat cut types as bit-vectors (compare the Optimizer Reference Manual) - load cut if any bit matches any bit set in cuttype;
3 | treat cut types as bit-vectors (compare the Optimizer Reference Manual) - 0 load cut if all bits match those set in cuttype.

Further information
This function should be called only from within callback functions set by either problem.addOptnodeCallback, problem.addPrenodeCallback, problem.addNodeLPSolvedCallback or problem.addPreIntsolCallback.
Related topics
problem.addCuts, problem.delCPCuts, problem.delCuts, problem.getCPCutList, the Optimizer Reference Manual.
Parent Topic Xpress problem object methods

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