Mathematical Documentation

• BQP Reformulations
• Domain Reduction
• Introduction
• Optimality based bounds tightening (OBBT)
• Feasibility based bounds tightening (FBBT)
• Constraint propagation (CP)
• Branching strategies
• Introduction
• Most Violated Term
• Strong branching
• Max Separation Distance
• Hybrid integer least reduced axis
• Primal heuristics
• Nonlinear Feasibility Pump
• Starting point strategies
• Relaxations
• Nonlinear Relaxation for Convex MINLPs

• Pyomo
• Octeract Neural with Pyomo on Linux
• Octeract Neural with Pyomo on Windows

• How to set options
• Options reference
• APPLY CB
• BIG COEFF TOLERANCE
• BIG GAP TOLERANCE
• BINARY REFORMULATION PROCEDURE
• BOUND VIOLATION TOLERANCE
• BQCQP REFORMULATION METHOD
• BQP REFORMULATION METHOD
• BQP SPARSITY TOLERANCE
• BRANCHING STRATEGY
• CALCULATE LB LARGE COEFFS
• CONSTRAINT VIOLATION TOLERANCE
• CONVERGENCE TOLERANCE
• CP MAX ITERATIONS
• CP NUMBER COMPARISON TOLERANCE
• CP SCALING
• CP VOLUME IMRPOVEMENT FACTOR
• CUT POOL MAX SIZE
• FBBT MAX ITERATIONS
• FBBT TIMEOUT
• FBBT TOLERANCE
• FIRST FEASIBLE SOLUTION
• HEUR MINLP DIVING
• FORCE EXPANSION
• HEUR CONSTRAINT PENALTY
• HEUR CONSTRAINT PENALTY COEFF
• HEUR CS
• HEUR FIXING
• HEUR GUIDED DIVING
• HEUR INEQUALITY
• HEUR LB
• HEUR NL FEASIBILITY PUMP
• HEUR PENALTY
• HEUR QPDIVING
• HEUR SAP
• HEUR SUPREME
• HEUR ZERO
• INFINITY
• INTEGER REFORMULATION VAR RANGE LIMIT
• INTEGRALITY VIOLATION TOLERANCE
• IPOPT INITIAL VALUE
• PURGE CUTS
• LLB TOLERANCE
• LOCAL SEARCH
• LP SOLVER
• MAX CB DEPTH
• MAX SOLVER ITERATIONS
• MAX SOLVER MEMORY
• MAX SOLVER TIME
• MILP LB MAX NODES
• MILP LB TIMEOUT
• MILP SOLVER
• MIP SOLVER
• NUMBER COMPARISON TOLERANCE
• NUM CORES
• OBBT MAX DEPTH
• OBBT MAX ITERATIONS
• OUTPUT FREQUENCY
• OUTPUT TIME FREQUENCY
• PRESOLVE
• PRINT SOLUTION
• QCQP SOLVER
• QP SOLVER
• REDUCE LINEAR CONSTRAINTS
• REFORMULATE BINARIES
• REFORMULATE INTEGERS
• REFORMULATE INTEGER IN MIQCQP
• SOLVE CONTINUOUS RELAXATION
• STARTING POINT IPOPT
• STRENGTHEN LINEAR CONSTRAINTS
• STRONG BRANCHING DEPTH
• STRONG BRANCHING VARIABLE COUNT
• UB FREQUENCY
• USE AUTOMATIC EXPANSION
• USE CONVEXITY CUTS
• USE CP
• USE FBBT
• USE MILP RELAXATION
• USE NONLINEAR RELAXATION
• USE NONLINEAR RELAXATION FOR CONVEX MINLP
• USE OBBT
• USE PROBING
• USE REDUCED COST
• USE REFORMULATION LINEARIZATION
• USE SIMPLIFICATION
• USE STRUCTURE DETECTOR
• WARM START PATH

• Input flags
• Exit flags

• Windows Installation Tutorial
• Linux Installation Tutorial
• Solving your first problem
• MPI tutorial
• JuMP tutorial
• JuMP on Windows
• JuMP on Linux
• Pyomo tutorial
• Pyomo on Windows
• Pyomo on Linux