USER'S GUIDE

  • AIMMS Basics
  • Creating and Managing a Model
  • Data Management
  • AIMMS and Solvers
    • AIMMS IDE
    • Solvers
      • BARON
      • CBC
      • CONOPT
      • COPT
      • CP Optimizer
      • CPLEX
        • CPLEX
        • CPLEX to AIMMS Mapping
        • AIMMS to CPLEX Mapping
        • Benders Decomposition
        • Callback Procedures
        • Feasopt (Feasibility Relaxation)
        • Indicator Constraints
        • Multi-Objective Optimization
        • Multiple MIP Starts
        • Parallel Concurrent Optimizer
        • SOCP
        • Solution Pool
        • Solution Pool Filters
        • SOS Types
        • SubMIP
        • Troubleshooting
        • Tuning Tool
        • User Cuts and Lazy Constraints
        • CPLEX Options
          • General
          • Simplex
          • Barrier
          • Benders
          • MIP
            • Backtrack
            • Branch
            • Difference Objective
            • Integrality
            • Maximal Number of Nodes
            • MIP Basis
            • MIP Candidate List
            • MIP Dive Strategy
            • MIP Emphasis
            • MIP Kappa
            • MIP Method
            • MIP Node Presolve
            • MIP Priority Order Switch
            • MIP Priority Order Type
            • MIP Probing
            • MIP Search Strategy
            • MIP Start Algorithm
            • MIP Tree Memory Limit
            • MIP Update
            • Node File
            • Number of Repair Attempts
            • Number of Simplex Iterations
            • Probing Time
            • Probing Time Deterministic
            • Relative Difference Objective
            • Select Variables
            • Selection of Nodes
            • Use Generic Callbacks
            • Working Memory Limit
            • Write MIP Starts
          • MIP Advanced
          • MIP Cuts
          • MIP Heuristics
          • MIP Preprocessing
          • MIP Solution Polishing
          • MIP Solution Pool
          • Network
          • Parallel
          • Preprocessing
          • QP
          • Tuning
          • Logging
      • GUROBI
      • IPOPT
      • KNITRO
      • MINOS
      • ODH-CPLEX
      • PATH
      • SNOPT
      • XA
  • Miscellaneous
User's Guide
AIMMS Logo
  • User's Guide »
  • AIMMS and Solvers »
  • Solvers »
  • CPLEX »
  • CPLEX Options »
  • MIP
  • Edit on Github

MIP

  • Backtrack
  • Branch
  • Difference Objective
  • Integrality
  • Maximal Number of Nodes
  • MIP Basis
  • MIP Candidate List
  • MIP Dive Strategy
  • MIP Emphasis
  • MIP Kappa
  • MIP Method
  • MIP Node Presolve
  • MIP Priority Order Switch
  • MIP Priority Order Type
  • MIP Probing
  • MIP Search Strategy
  • MIP Start Algorithm
  • MIP Tree Memory Limit
  • MIP Update
  • Node File
  • Number of Repair Attempts
  • Number of Simplex Iterations
  • Probing Time
  • Probing Time Deterministic
  • Relative Difference Objective
  • Select Variables
  • Selection of Nodes
  • Use Generic Callbacks
  • Working Memory Limit
  • Write MIP Starts
Last updated: Aug 28, 2025

Help & Feedback

Docs

Edit this page to fix an error or add an improvement in a pull request
Create an issue to suggest an improvement to this page

Product

Create a topic if there's something you don't like about this feature
Propose functionality by submitting a feature request

Support

Not what you where looking for? Search the docs

Remember we also have Community support

Still having trouble ? Reach out to us


Next Previous

AIMMS
AIMMS COMMUNITY
AIMMS DOCS
DISCLAIMER
PRIVACY STATEMENT
© 1989 - 2025 AIMMS B.V.