AIMMS to Knitro 14.0 Mapping
Description
The table shows in the left column the AIMMS Knitro options; the right column displays for the AIMMS option the Knitro option that is associated with it.
Option name in AIMMS Name in Knitro
Estimate Noise in the Model findiff_estnoise
Gradient Computation Method gradopt
Initial Penalty Value initpenalty
Initial Pivot Treshold linsolver_pivottol
Initial Trust Scaling Factor delta
Linesearch Strategy linesearch
Linesearch Trials Limit linesearch_maxtrials
LP Algorithm act_lpalg
Objective Reduction act_lppenalty
LP Presolve act_lppresolve
QP and QCQP Initialization Strategy ncvx_qcqp_init
Solution Progress Iterations xtol_iters
Solution Progress Tolerance xtol
Data Check datacheck
Debugging MIP output mip_debug
Debugging Output debug
Act QPpenalty act_qppenalty
Algorithm algorithm
BLAS Option blasoption
Honor Bounds honorbnds
Linear Solver linsolver
Linear Solver Node Amalgamation linsolver_nodeamalg
Linear Solver Ordering linsolver_ordering
Linear Solver Out of Core linsolver_ooc
Linear Solver Scaling linsolver_scaling
Linear System Max Iterative Refinements linsolver_maxitref
LP Solver act_lpsolver
Mark as Convex convex
QP Algorithm act_qpalg
Restarts restarts
Restarts Iteration Limit restarts_maxit
Scale Variables scale_vars
Scaling scale
Unboundedness Range objrange
Warm Start Strategy strat_warm_start
Hessian Computation Method hessopt
Limited Memory Size lmsize
Barrier Corrector Steps Limit bar_maxcorrectors
Barrier Enable Conic bar_conic_enable
Barrier Globalize bar_globalize
Barrier Maximum Mu bar_maxmu
Barrier MPEC Heuristic bar_mpec_heuristic
Barrier Parameter Strategy bar_murule
Barrier Penalty Constraint Strategy bar_penaltycons
Barrier Penalty Parameter Strategy bar_penaltyrule
Barrier Refinement bar_refinement
Barrier Relax Constraints bar_relaxcons
Barrier Slack Bound Push bar_slackboundpush
Barrier Switch Objective bar_switchobj
Barrier Switch Rule bar_switchrule
Barrier Watchdog bar_watchdog
Conjugate Gradient Iteration Limit cg_maxit
Conjugate Gradient Memory Limit cg_pmem
Conjugate Gradient Preconditioner cg_precond
Conjugate Gradient Stopping Tolerance cg_stoptol
Crossover Iterations Limit bar_maxcrossit
Direct Step Interval bar_directinterval
Feasible Mode bar_feasible
Feasible Mode Activation Tolerance bar_feasmodetol
Initial Barrier Parameter Value bar_initmu
Initial Barrier Penalty Value MPEC bar_initpi_mpec
Initial Point Strategy bar_initpt
Linear System Form Used bar_linsys
Linear System Memory Usage bar_linsys_storage
Refactorization Limit bar_maxrefactor
Integrality mip_integer_tol
Maximal Number of Nodes mip_maxnodes
Maximal Number of Subproblem Solves mip_maxsolves
MIP Algorithm mip_lpalg
MIP Branching Rule mip_branchrule
MIP GUB Branch mip_gub_branch
MIP Heuristic mip_heuristic
MIP Heuristic Diving mip_heuristic_diving
MIP Heuristic Feasibility Pump mip_heuristic_feaspump
MIP Heuristic Iteration Limit mip_heuristic_maxit
MIP Heuristic Large Neighborhood Search mip_heuristic_lns
MIP Heuristic Local Search mip_heuristic_local_search
MIP Heuristic MPEC mip_heuristic_mpec
MIP Heuristic Strategy mip_heuristic_strategy
MIP Heuristic Terminate mip_heuristic_terminate
MIP Implications mip_implications
MIP Integer Variables Relaxable mip_relaxable
MIP Integer Variables Strategy mip_intvar_strategy
MIP Method mip_method
MIP MISQP Heuristic mip_heuristic_misqp
MIP Multistart mip_multistart
MIP Objective Cutoff Value mip_cutoff
MIP Pseudo Cost Initialization mip_pseudoinit
MIP Restart mip_restart
MIP Rounding mip_rounding
MIP Start Algorithm mip_rootalg
MIP Terminate mip_terminate
Node Algorithm mip_nodealg
Node Selection mip_selectrule
Node Selection_Direction mip_selectdir
Strong Branching Candidates Limit mip_strong_candlim
Strong Branching Iteration Limit mip_strong_maxit
Strong Branching Level mip_strong_level
Clique Cuts mip_clique
Flow Cover Cuts mip_cut_flowcover
Gomory Cuts mip_gomory
Knapsack Cuts mip_knapsack
Lift and Project Cuts mip_liftproject
MIR Cuts mip_mir
Probing Cuts mip_cut_probing
Zero Half Cuts mip_zerohalf
Multistart ms_enable
Multistart Deterministic ms_deterministic
Multistart Initial Points Cluster ms_initpt_cluster
Multistart Range ms_startptrange
Multistart Range Unbounded Variable ms_maxbndrange
Multistart Seed ms_seed
Multistart Single Solve Time Limit
Multistart Termination Condition ms_terminate
Number of Best Solutions ms_num_to_save
Number of Multistart Points ms_maxsolves
Solution Distance ms_savetol
Number of Gradient Computation Threads findiff_numthreads
Number of BLAS Threads blas_numthreads
Number of Linear System Threads linsolver_numthreads
Number of MIP Threads mip_numthreads
Number of Multistart Threads ms_numthreads
Number of Threads numthreads
Presolve presolve
Presolve Identify Linear Variables
Presolve Initial Point presolve_initpt
Presolve Level presolve_level
Presolve Passes presolve_passes
Presolve Redundant Constraints presolveop_redundant
Presolve Substitution presolveop_substitution
Presolve Substitution Tolerance presolveop_substitution_tol
Presolve Tolerance presolve_tol
Tighten Variable Bounds presolveop_tighten
MIP Output Level mip_outinterval
Multi Algorithm Output ma_outsub
Status File Display outlev
Absolute Optimality Tolerance opttol_abs
Function Evaluations Limit maxfevals
Infeasibility Tolerance Iteration Limit infeastol_iters
Multi Algorithm Termination ma_terminate
Objective Goal fstopval
Relative Improvement Iterations ftol_iters
Relative Improvement Tolerance ftol
Relative Optimality Tolerance opttol
Absolute Feasibility Tolerance feastol_abs
Infeasibility Tolerance infeastol
LP Feasibility Tolerance act_lpfeastol
Relative Feasibility Tolerance feastol
Tuner tuner
Tuner Output tuner_outsub
Tuner Terminate tuner_terminate
Tuner Time Limit tuner_maxtime_cpu