public static class IloCplex.Algorithm
extends java.lang.Object
IloCplex.IntParam.RootAlg and
IloCplex.IntParam.NodeAlg that specify the algorithm to use to
solve the root relaxation and the other node problems during branch-and-cut
search, respectively. These parameters can be set with method
IloCplex.setParam.| Modifier and Type | Field and Description |
|---|---|
static int |
Auto
Allows
IloCplex to select an algorithm. |
static int |
Barrier
Selects the barrier algorithm.
|
static int |
Concurrent
Selects the concurrent optimizer.
|
static int |
Dual
Selects the dual simplex algorithm.
|
static int |
FeasOpt
This value may not be used to select an optimizer but is returned by
IloCplex.getAlgorithm when the method feasOpt has
generated the current solution. |
static int |
MIP
This value may not be used to select an optimizer but is returned by
IloCplex.getAlgorithm when the mixed integer optimizer has
generated the current solution. |
static int |
Network
Selects the network simplex algorithm.
|
static int |
None
Selects no algorithm.
|
static int |
Primal
Selects the primal simplex algorithm.
|
static int |
Sifting
Selects the sifting algorithm.
|
| Constructor and Description |
|---|
IloCplex.Algorithm() |
public static final int None
IloCplex.Algorithm.None as the crossover algorithm for
the barrier method (parameter IloCplex.IntParam.BarCrossAlg), no
crossover to a simplex solution is performed after the barrier optimization.public static final int Auto
IloCplex to select an algorithm. This algorithm choice
instructs the IloCplex optimizer to select the most suitable or
default optimizer for solving LPs, QCPs, or QPs.public static final int Primal
IloCplex optimizer to use the primal simplex method for solving
LPs or QPs.public static final int Dual
IloCplex optimizer to use the dual simplex method for solving
LPs or QPs.public static final int Network
IloCplex optimizer to use the network simplex method on the
embedded network for solving LPs or QPs and to continue with a simplex
method.public static final int Barrier
IloCplex optimizer to use the barrier optimizer to solve an LP,
QCP, or QP. When solving an LP or QP, the optimizer performs a crossover to a
simplex solution unless the parameter
IloCplex.IntParam.BarCrossAlg is set to
IloCplex.Algorithm.None.public static final int Sifting
IloCplex optimizer to use the sifting optimizer to solve LP
problems. The sifting optimizer is available only for LPs; other attempts to
use this choice will map to Auto.public static final int Concurrent
IloCplex optimizer to use several algorithm options
concurrently.public static final int FeasOpt
IloCplex.getAlgorithm when the method feasOpt has
generated the current solution.public static final int MIP
IloCplex.getAlgorithm when the mixed integer optimizer has
generated the current solution.