XpressProblem.BranchObject
- java.lang.Object
-
- com.dashoptimization.XPRSobject
-
- com.dashoptimization.XPRSbranchobject
-
- com.dashoptimization.objects.XpressProblem.BranchObject
-
- All Implemented Interfaces:
-
java.lang.AutoCloseable
- Enclosing class:
- XpressProblem
public static class XpressProblem.BranchObject extends XPRSbranchobject
Subclass ofXPRSbranchobjectthat allows usingVariableinstances to specify bounds and constraints. Instances of this class always expects bounds and expressions to be specified in terms of the original space (not presolved space).- Since:
- 43.00
-
-
Method Summary
Modifier and Type Method Description voidaddBound(int branch, byte bndtype, Variable variable, double bndval)Add a single bound to this branch object.voidaddBounds(int branch, int nbounds, byte[] bndtype, Variable[] variables, double[] bndval)Add bounds to this branching object.voidaddConstraint(int branch, Inequality.Definition constraint)Add a row/cut to this branch object.-
Methods inherited from class com.dashoptimization.XPRSbranchobject
addBounds, addBranches, addCuts, addMsgHandlerListener, addMsgHandlerListener, addMsgHandlerListener, addMsgHandlerListener, addRows, close, getBounds, getBounds, getBranches, getID, getLastError, getLastError, getRows, getRows, removeMsgHandlerListener, removeMsgHandlerListener, removeMsgHandlerListeners, setPreferredBranch, setPriority, store, validate
-
Methods inherited from class com.dashoptimization.XPRSobject
addMsgHandlerListener, addMsgHandlerListener, destroy, isDestroyed
-
-
-
-
Method Detail
-
addBounds
public void addBounds(int branch, int nbounds, byte[] bndtype, Variable[] variables, double[] bndval)Add bounds to this branching object. The function takes three parallel arrays (bndtype,variables,bndval) that specify the bounds to be added. Each of these arrays must be of length at leastnboundsand for each i in [0,nbounds[ the boundvariable[i] bndtype[i] bndval[i]is added.Examples using
addBounds:- Parameters:
-
branch- The branch on which bounds are added. -
nbounds- Number of bounds to add. -
bndtype- Bound types: 'L' for lower, or 'U' for upper -
variables- Variables on which bounds are added. -
bndval- Actual bounds for the variables. - Since:
- 43.00
-
addBound
public void addBound(int branch, byte bndtype, Variable variable, double bndval)Add a single bound to this branch object.- Parameters:
-
branch- The branch on which the bound is added -
bndtype- Bound type: 'L' for lower, 'U' for upper. -
variable- The variable on which the bound is added. -
bndval- The bound onvariable. - Since:
- 43.00
-
addConstraint
public void addConstraint(int branch, Inequality.Definition constraint)Add a row/cut to this branch object.Examples using
addConstraint:- BinBurglar.java
- BoolVars.java
- Boxes02.java
- Capbgt2l.java
- CapitalBudgeting.java
- Catenary.java
- CuttingStock.java
- ELS.java
- ELSManagedCuts.java
- Folio.java
- FolioCB.java
- FolioHeuristic.java
- FolioIIS.java
- FolioInit.java
- FolioMip1.java
- FolioMip2.java
- FolioMipIIS.java
- FolioQC.java
- FolioQP.java
- GeneralConstraints.java
- Glidert.java
- MultipleKnapsack_Arrays.java
- MultipleKnapsack_Collections.java
- MultipleProblems.java
- PiecewiseLinear.java
- PolygonObjects.java
- ProductionPlanning_Index.java
- PurchasePWL.java
- PurchaseSOS2.java
- QuadraticProgramming.java
- RecursiveFinancialPlanning.java
- Sangraalind.java
- SpecialOrderedSets.java
- SpecialOrderedSetsQuadratic.java
- Parameters:
-
branch- The branch on which the row is added. -
constraint- The constraint to add. - Since:
- 43.00
-
-
© 2001-2025 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.