Octeract Home
My Account
Get it Free
Documentation
Overview
Getting Started
Introduction to Mathematical Optimisation for MINLPs
Solving your First Problem
Manuals
Octeract Engine Installation Guide
C++ Reference Manual
Python API Reference Manual
Tutorials
Running in Parallel Mode Using MPI
Authentication Token Guide
How to use AMPL with Octeract Engine
How to use C++ with Octeract Engine
How to use GAMS with Octeract Engine
How to use JuMP with Octeract Engine
How to use Pyomo with Octeract Engine
How to use Python with Octeract Engine
Solver Options
How to Set Options
General Solver Settings
Convergence Settings
Domain Reduction
Presolve
Primal Heuristics
Third-party Solvers
Tolerances
Variable Branching
All Available Options
Solver Flags
Input Flags
Exit Flags
Domain Reduction
Introduction to Domain Reduction
Optimisation Based Bounds Tightening (OBBT)
Feasibility Based Bounds Tightening (FBBT)
Constraint Propagation (CP)
Branching Strategies
Introduction to Branching Strategies
What is Branching Strategy?
Most Violated Term
Hybrid Integer Least Reduced Axis
Max Separation Distance
Strong Branching
Violation Transfer
Primal Heuristics
Nonlinear Feasibility Pump
Reformulations
Binary Quadratic Problem (BQP) Reformulation Method
Relaxations
Nonlinear Relaxation for Convex MINLPs
Starting Point
Starting Point for IPOPT
Blog
Out-of-the-box doesn't work. Now what?
Getting to Know the Engine: an Overview
Home
>
Solver Options
>
All Available Options
1.
APPLY_CB
2.
BIG_COEFF_TOLERANCE
3.
BIG_GAP_TOLERANCE
4.
BINARY_REFORMULATION_PROCEDURE
5.
BOUND_VIOLATION_TOLERANCE
6.
BQCQP_REFORMULATION_METHOD
7.
BQP_REFORMULATION_METHOD
8.
BQP_SPARSITY_TOLERANCE
9.
BRANCHING_STRATEGY
10.
CALCULATE_LB_LARGE_COEFFS
11.
CBC_LB_MAX_NODES
12.
CBC_PRESOLVE
13.
CONSTRAINT_VIOLATION_TOLERANCE
14.
CONVERGENCE_TOLERANCE
15.
CP_MAX_ITERATIONS
16.
CP_NUMBER_COMPARISON_TOLERANCE
17.
CP_SCALING
18.
CP_VOLUME_IMPROVEMENT_FACTOR
19.
CUT_POOL_MAX_SIZE
20.
FBBT_MAX_ITERATIONS
21.
FBBT_TIMEOUT
22.
FBBT_TOLERANCE
23.
FIRST_FEASIBLE_SOLUTION
24.
FORCE_EXPANSION
25.
HEUR_CONSTRAINT_PENALTY
26.
HEUR_CONSTRAINT_PENALTY_COEFF
27.
HEUR_CS
28.
HEUR_FIXING
29.
HEUR_GUIDED_DIVING
30.
HEUR_LB
31.
HEUR_MINLP_DIVING
32.
HEUR_NL_FEASIBILITY_PUMP
33.
HEUR_PENALTY
34.
HEUR_QPDIVING
35.
HEUR_SAP
36.
HEUR_ZERO
37.
INFINITY
38.
INTEGER_REFORMULATION_VAR_RANGE_LIMIT
39.
INTEGRALITY_VIOLATION_TOLERANCE
40.
IPOPT_INITIAL_VALUE
41.
IS_PURGE_CUTS_ENABLED
42.
LLB_TOLERANCE
43.
LP_SOLVER
44.
MAX_CB_DEPTH
45.
MAX_SOLVER_ITERATIONS
46.
MAX_SOLVER_MEMORY
47.
MAX_SOLVER_TIME
48.
MILP_LB_TIMEOUT
49.
MILP_SOLVER
50.
MIP_SOLVER
51.
NUMBER_COMPARISON_TOLERANCE
52.
NUM_CORES
53.
OBBT_MAX_DEPTH
54.
OBBT_MAX_ITERATIONS
55.
OUTPUT_FREQUENCY
56.
OUTPUT_TIME_FREQUENCY
57.
PRINT_SOLUTION
58.
QCQP_SOLVER
59.
QP_SOLVER
60.
REFORMULATE_BINARIES
61.
REFORMULATE_INTEGERS
62.
REFORMULATE_INTEGERS_IN_MIQCQP
63.
SOLVE_CONTINUOUS_RELAXATION
64.
STARTING_POINT_IPOPT
65.
STRONG_BRANCHING_VARIABLE_COUNT
66.
UB_FREQUENCY
67.
USE_AUTOMATIC_EXPANSION
68.
USE_CONVEXITY_CUTS
69.
USE_CP
70.
USE_FBBT
71.
USE_MILP_RELAXATION
72.
USE_NONLINEAR_RELAXATION_FOR_CONVEX_MINLP
73.
USE_OBBT
74.
USE_PROBING
75.
USE_REDUCED_COST
76.
USE_REFORMULATION_LINEARIZATION
77.
USE_SIMPLIFICATION
78.
USE_STRUCTURE_DETECTOR
79.
WARM_START_PATH
Was this helpful?
YES
|
NO
Thank you for your confirmation. We are glad you found the article helpful.
Please
contact us
if you have any suggestions.
Please make sure you fill the comments section before sending.
Send
Thank you for your comments.
Please
contact us
if you need any further support.
so/so1007