User’s Guide
Please find the PDF version of the AIMMS User’s Guide here.
- AIMMS Basics
- Creating and Managing a Model
- Data Management
- AIMMS and Solvers
- AIMMS IDE
- AIMMS IDE Overview
- Model Explorer
- Model Explorer Introduction
- Name Changes
- Menubar
- Toolbar
- How to …
- Open the Model Explorer
- Find Information in the Model Explorer
- Create New Nodes
- Manipulate the Model Tree
- Modifying a Selection
- Saving a Selection
- Change the Node Type
- Show Full Arguments
- Show Node Types
- Text Representation of a Selection
- Text Representation of a Model
- Re-Use Text Window
- Cut, Copy, Paste and Delete in Attribute Forms
- Export part of the model
- Import part of the model
- Nodes
- Nodes in the Model Tree
- Identifier Nodes
- Structuring Nodes
- Identifiers
- Creating an Arc
- Creating an Assertion
- Creating a Calendar Identifier
- Creating a Complementarity Variable
- Creating a Constraint
- Creating a Convention
- Creating a Database Table
- Creating an Element Parameter
- Creating a File
- Creating a Horizon
- Creating an Index
- Creating a Macro
- Creating a Mathematical Program
- Creating a Node
- Creating a Parameter
- Creating a Quantity
- Creating a Set
- Creating a String Parameter
- Creating a Unit Parameter
- Creating a Variable
- Procedures and Functions
- Structuring Nodes
- Attribute Form
- Syntax Editor
- Miscellaneous
- Identifier Selector
- Identifier Selector
- View Window Introduction
- View Definition Properties
- Menubar
- Toolbar
- How to …
- Create a Conditional Selector
- Create a Node Selector
- Create a Set Dependency Selector
- Modify the Properties of a Conditional Selector
- Modify the Properties of a Node Selector
- Modify the Properties of a Set-Dependency Selector
- Change the columns of a View Window
- Change the rows of a View Window
- Select rows or cells in a view window
- Open a View Window
- Make Data Changes in a View Window
- Change the type of set operation
- Combine Selectors
- Manage the View Definitions
- Modify a Node Selector via Drag-and-Drop
- Use Identifier Selections
- View Identifier Selections
- Nodes
- Page Manager
- Page Manager Introduction
- Nodes in the Page Navigation Tree
- Page Navigation
- Relations between Pages
- Hidden Pages
- Page Separators
- Out-of-date Pages
- Menubar
- Toolbar
- How to …
- Open the Page Manager
- Manipulate the Page Navigation Tree
- Cut, Copy and Paste in the Page Manager
- Maintaining Pages
- Finding Pages and Templates
- Finding Used Pages and Templates
- List Identifiers that are Used on Pages
- Create a Separator
- Cut, Copy, Paste and Delete Page Objects
- Cut, Copy, Paste and Delete in Attribute Forms
- Open Page without Template
- Page
- Construct Identifier Dialog Box
- Page Objects
- Page Objects Introduction
- Page Object Properties
- Opening the Property Dialog Box
- Double Click in Page Object
- Expressions in the GUI
- Selecting Objects on a Page
- Moving Objects on a Page
- Tags
- Shared Object Properties
- Fonts
- Identifiers in an Object
- 2D Chart
- 3D Chart
- Slider
- Calendar Object
- DateTimePicker
- Document Viewer
- Table
- Pivot Table
- Composite Table
- Scalar
- Sparse List
- Bar Chart
- Curve
- Parametric Curve
- Gantt Chart
- Network
- Button
- Navigation
- Selection
- Floating Index
- File Name
- Indexed Page
- Tabbed Page
- Text
- Line
- Rectangle
- Circle
- Picture
- Template Manager
- Menu Builder
- Menu Builder Introduction
- Menubar
- Toolbar
- How to …
- Open the Menu Builder
- Manipulate the Menu Tree
- Create a menu bar
- Create a Tool Bar
- Create a popup menu
- Create a menu item
- Link Menus to Pages or Page Objects
- Preview Menu Bars, Tool Bars and Popup Menus
- Specify Your Own Bitmap on a Tool Bar Button
- Make Duplicate Nodes in the Menu Tree
- Find Menus
- List Used Identifiers Associated with Menu Tree Nodes
- Show Node Type
- Specify a Shortcut Key
- List Pages Associated with Menu Tree Nodes
- Menu Node Properties
- Nodes
- Security
- Miscellaneous
- AIMMS Windows
- AIMMS Files
- AIMMS Trees
- Layouts
- Exporting an End User Project
- Backups
- Colors
- Command Line Options
- Grab Screen Area
- Help files for AIMMS projects
- Localization
- Solver Configuration
- XML
- Short Descriptions
- Child Page
- Dialog Box
- Forward Link
- Reverse Link
- Maxint
- Start Window Menubar
- Text Editor
- Command Line Options - License
- File Printing
- User Files in the Project File
- Deleting the Listing File
- Updatebility of Identifiers
- Executing a Procedure
- Exit AIMMS
- Closing a Window
- Closing All Windows
- Start Window Toolbar
- Print Setup
- Closing a Project
- Saving a Project
- Navigating the open Windows
- Stopping Execution
- Compilation
- Help on Window
- About AIMMS Dialog Box
- AIMMS Start Window
- State File Manager
- Commit Name Changes
- Help - Contents and Index
- Opening a Project
- Creating a Project
- Linking Objects
- Different Results in NLP Runs
- Undo Edit
- Save As a New Page
- Keep Page Open
- Save a Page
- Executing the Main Model
- Previous Page
- Next Page
- Variables in GUI
- Name Completion
- Identifier Selection Dialog Box
- Wizards
- MainInitialization
- MainExecution
- MainTermination
- Find & Replace
- Find All
- Identifier Info
- Maximize Attribute Window
- Insert Current Data
- Goto Line
- New Dataset
- Save Case Dialog Box
- Load Case Dialog Box
- New Case
- Scalar Object in User Mode
- User Logoff
- User Change Password
- Installing System Modules
- Tuning - Code Generation
- Memory Manager - Data Area Size
- Memory Manager - Standard Block Area Size
- Memory Manager - Static Area Size
- Memory Manager - Work Area Size
- Calculation of Shadow Price Ranges
- Parent Page
- Generate Public/Private Key Pair
- Multi Development
- Diagnostic Tools
- Debugger
- AIMMS Debugger
- Activating the Debugger
- Closing the Debugger
- Setting a Breakpoint
- Removing a Breakpoint
- Specifying a Condition for a Breakpoint
- List of Breakpoints Dialog Box
- Viewing and Modifying Breakpoints
- Examining Data while Debugging
- Stepping through the Execution of a Model using Breakpoints
- Break on Error
- Call Stack Dialog Box
- Profiler
- Identifier Cardinalities
- Math Program Inspector
- AIMMS Math Program Inspector
- Opening the Math Program Inspector
- Bookmarks Menu
- Actions Menu
- Actions
- Resolve
- Associated Variables
- Associated Constraints
- Irreducible Inconsistent System (IIS)
- Substructure Causing Unboundedness
- Substructure Causing Infeasibility
- Bound Analysis
- Infeasible Constraints & Violated Bounds
- Unbounded Variables
- Unreferenced Identifiers
- Scale Model
- Create Constraint Listing
- Edit Menu
- View Menu
- Debugger
- Options
- AIMMS Options
- Opening the Options Dialog Box
- Changing the Value of an Option
- Setting an Option to its Default
- Project
- Startup & Authorization
- Directories
- Standard Data Pages
- Page editing defaults
- Appearance
- WebUI
- Tooltips
- Data Manager
- Math Program Inspector
- Bad Scaling Threshold
- MPI Feasibility Tolerance
- MPI Bound Tolerance
- Unboundedness Analysis Bound
- Maximum Number of Nodes in Tree
- Show Branch and Bound Progress
- Show Branch and Bound Tree
- Restore Original Solution After Analysis
- Store Complete Solver Solution
- Store Nonlinear Presolve Info
- Use IIS From Solver
- Scale Using Solution
- Help
- End-User Menus
- AIMMS
- Getting Help about an Option
- Seed
- Variable default range type
- Execution Tolerances
- Comparison
- Progress, Errors & Warnings
- Reporting
- Case Management
- External Functions
- XML
- Database Interface
- Backward Compatibility
- Api Accesses All Identifiers
- Current Time in LocalDST
- Derive Definitions Stochastic Parameters
- Elapsed Time is Unitless
- Element Sequence Always Include Upper Bound
- Enable SOS Priority attribute
- Evaluate Definition Directly after Modification
- Execution Respects Declaration Domain
- Integer Variable Default Upperbound
- Negate Objective Coefficient Modifications
- Ordered Constraint Presentation
- Remove Trailing Spaces from Quoted Elements
- Require Binding Domain for To Be Indices Only
- Rounding Compatibility
- Save Model Basis
- Scalar Suffix Reference Substitution
- Singleton Unit Namespace
- Solution Time Has Unit Seconds
- Use UTC forCaseAndStartEndDate
- Warning Difference Execution Respects Declaration Domain
- Write in Backup Mode Ordering
- Tuning
- Compilation
- Solvers General
- AIMMS Presolver
- Display Infeasibility Analysis
- Evaluations Range Integer Variables
- Linear Presolve
- List Presolve Reductions
- MINLP Probing
- Nonlinear Presolve
- OBBT
- Presolve Constraints Used
- Presolve Copy Model
- Presolve Cycle Limit
- Presolve Dual Reductions
- Presolve Feasibility Tolerance
- Presolve Numeric Switch
- Presolve Remove Duplicate Variables
- Reformulate Constraints
- Remove Doubletons
- Infeasibility analysis
- Interface
- Matrix Generation
- Memory
- MIP Options
- Postsolve
- Robust Optimization
- Scaling
- Sensitivity
- Standard Reports
- Stochastic Programming
- Stop Criteria
- Update Technology
- AIMMS Presolver
- Specific Solvers
- Solvers
- BARON
- CBC
- CONOPT
- CONOPT
- CONOPT to AIMMS Mapping
- AIMMS to CONOPT Mapping
- Description of CONOPT Algorithm
- Troubleshooting
- CONOPT Options
- General
- Advanced
- Box Size Factor Linear Variables
- Box Size Tolerance
- Box Size Tolerance Linear
- Fixed Variables Tolerance Derived Bounds
- Fixed Variables Tolerance Initial Bounds
- Logical Switch for Selection of Slacks
- Method for Defined Variables
- Method for Finding Maximal Step
- Method for Finding Maximal Tight Step
- Method for Linear Feasibility Models
- Method for Reduced Hessian
- Penalty Constraints Ratio
- Relative Objective Accuracy
- SLP Mode
- SQP Mode
- Steplength Multiplier
- Use No-Penalty Model
- Zero Filter Tolerance Jacobian Elements
- Limits
- Parallel
- Pivot
- Preprocessing
- Reporting
- Scaling
- Stop criteria
- Debugging
- COPT
- CP Optimizer
- CP Optimizer
- CP Optimizer to AIMMS Mapping
- AIMMS to CP Optimizer Mapping
- CP Optimizer Options
- General
- Inference
- Parallel
- Preprocessing
- Search
- Branch limit
- Choice point limit
- Dynamic probing
- Dynamic probing strength
- Failure directed search
- Failure directed search emphasis
- Failure directed search memory limit
- Failure limit
- Number of search points
- Random seed
- Restart failure limit
- Restart growth factor
- Search type
- Value selection
- Variable selection
- Logging
- 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
- Advanced Start
- Check Solution
- Cleanup Coefficients
- Clock Type
- Cmd File
- Conflict Algorithm
- Data Check and Modeling Assistance
- Deterministic Time Limit
- Display Solution Statistics
- Farkas Infeasibility Proof
- Feasopt Tolerance
- LP File
- LP Method
- Memory Emphasis
- MPS
- Numerical Emphasis
- Ord File
- Random Seed
- Read Parameter File
- Restart
- Restart File Number
- Round Coefficients
- Sav File
- Scale
- Sensitivity Method
- Sifting Algorithm
- Solution File
- Solution Type
- Stealth Mode
- Unbounded Ray
- Updates Batch Size
- Write Annotations File
- Write Parameter File
- 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
- BQP Cuts
- Clique Cuts
- Cover Cuts
- Cut Generation Limit
- Cut Limit
- Cuts Factor
- Disjunctive Cuts
- Flow Cover Cuts
- Flow Path Cuts
- Gomory Cuts
- Gomory Cuts Candidate Limit
- Gomory Cuts Pass Limit
- GUB Cover Cuts
- Implied Bound Cuts
- Lift and Project Cuts
- Local Implied Bound Cuts
- MCF Cuts
- MIP Number of Cut Passes
- Mixed Integer Rounding Cuts
- Node Cuts
- RLT Cuts
- Zero Half Cuts
- MIP Heuristics
- MIP Preprocessing
- MIP Solution Polishing
- MIP Solution Pool
- Network
- Parallel
- Preprocessing
- QP
- Tuning
- Logging
- General
- Gurobi
- Gurobi
- Gurobi to AIMMS Mapping
- AIMMS to Gurobi Mapping
- FeasRelax (Feasibility Relaxation)
- Hints
- Indicator Constraints
- Multi-Objective Optimization
- Multiple MIP Starts
- Quadratic Programs
- Solution Pool
- SOS Types
- Troubleshooting
- Tuning Tool
- User Cuts and Lazy Constraints
- Gurobi Options
- General
- Calculate Kappa
- Concurrent Method
- Farkas Infeasibility Proof
- Feasibility
- FeasRelax Big M
- IIS Method
- Memory Limit
- Method
- MPS
- MPS Dual
- Multi Objective Method
- Numeric Focus
- Optimality
- Random Seed
- Read Parameter File
- Restart
- Restart File Number
- Scale
- Sensitivity Method
- Soft Memory Limit
- Solution File
- Solution Target
- Unbounded Ray
- Updates Batch Size
- Warm Start
- Work Limit
- Write Parameter File
- Barrier
- MIP
- Branch Direction
- Disconnected Component Strategy
- Hints File
- Improve Start Gap
- Improve Start Nodes
- Improve Start Time
- Integrality
- Integrality Focus
- Lazy Constraint Mode
- MIP Best Bound Stop
- MIP Best Objective Stop
- MIP Focus
- MIP Node Method
- MIP Start
- MIP Start Node Limit
- MIP Symmetry
- Node File Start
- Node Limit
- Select Variables
- MIP Cuts
- BQP Cuts
- Clique Cuts
- Cover Cuts
- Cut Aggregation Passes Limit
- Dual Implied Cuts
- Flow Cover Cuts
- Flow Path Cuts
- Global Cut Control
- Gomory Cut Passes Limit
- GUB Cover Cuts
- Implied Bound Cuts
- Infeasibility Proof Cuts
- Lift and Project Cuts
- MIP Separation Cuts
- MIR Cuts
- Mixing Cuts
- Mod K Cuts
- Network Cuts
- Projected Implied Bound Cuts
- Relax-and-Lift Cuts
- RLT Cuts
- Root Cut Passes Limit
- Strong CG Cuts
- Sub MIP Cuts
- Zero Half Cuts
- MIP Heuristics
- MIP Presolve
- Parallel
- Presolve
- Nonlinear
- Quadratic
- Simplex
- Solution Pool
- Tuning
- Logging
- General
- IPOPT
- IPOPT
- IPOPT to AIMMS Mapping
- AIMMS to IPOPT Mapping
- HSL libraries
- Troubleshooting
- IPOPT Options
- Barrier parameter
- Adaptive strategy factor limit
- Adaptive strategy oracle
- Barrier convergence tolerance factor
- Barrier parameter initial value
- Barrier parameter update strategy
- Execute Mehrotra algorithm
- Fixed mode oracle
- Linear decrease factor barrier parameter
- Maximum value for barrier parameter
- Minimum value for barrier parameter
- Quality function section steps limit
- Superlinear decrease rate barrier parameter
- Hessian perturbation
- Initialization
- Line search
- Linear solver
- Linear solver selection
- Linear system scaling
- Linear system scaling method
- MA27 increment factor for workspace size
- MA27 integer workspace memory
- MA27 maximum pivot tolerance
- MA27 pivot tolerance
- MA27 real workspace memory
- MA57 block size
- MA57 maximum pivot tolerance
- MA57 node amalgamation parameter
- MA57 pivot order
- MA57 pivot tolerance
- MA57 scaling
- MA57 small pivot parameter
- MA57 work space memory safety factor
- MA77 maximum pivot tolerance
- MA77 pivot tolerance
- MA86 maximum pivot tolerance
- MA86 pivot tolerance
- MA97 maximum pivot tolerance
- MA97 pivot tolerance
- Maximum number of refinement steps
- Minimum number of refinement steps
- MUMPS maximum pivot tolerance
- MUMPS permuting and scaling
- MUMPS pivot order
- MUMPS pivot tolerance
- MUMPS scaling
- MUMPS working space percentage increase
- Multipliers
- NLP
- NLP scaling
- Output
- Quasi-Newton
- Restoration phase
- Bound multipliers reset threshold
- Constraint multipliers reset threshold
- Force start in restoration phase
- Maximum multipliers infeasible problem
- Minimum violation infeasible problem
- Quickly detect infeasible problem
- Reduction factor primal dual error
- Required infeasibility reduction
- Use original objective function in restoration phase
- Termination
- Acceptable complementarity tolerance
- Acceptable constraint violation tolerance
- Acceptable dual infeasibility tolerance
- Acceptable objective change tolerance
- Acceptable relative convergence tolerance
- Complementarity tolerance
- Constraint violation tolerance
- Diverging iterates tolerance
- Dual infeasibility tolerance
- Maximum number of acceptable iterations
- Maximum number of iterations
- Relative convergence tolerance
- Derivative test
- Barrier parameter
- KNITRO
- Knitro
- Knitro to AIMMS Mapping
- AIMMS to Knitro Mapping
- Description of Knitro Algorithms
- Complementarities
- Tuner
- Knitro Options
- General
- Act QPpenalty
- Algorithm
- BLAS Option
- Honor Bounds
- Linear Solver
- Linear Solver Node Amalgamation
- Linear Solver Ordering
- Linear Solver Out of Core
- Linear Solver Scaling
- Linear System Max Iterative Refinements
- LP Solver
- Mark as Convex
- QP Algorithm
- Restarts
- Restarts Iteration Limit
- Scale Variables
- Scaling
- Unboundedness Range
- Use Initial Solution
- Warm Start Strategy
- Advanced
- Estimate Noise in the Model
- Gradient Computation Method
- Initial Penalty Value
- Initial Pivot Treshold
- Initial Trust Scaling Factor
- Linesearch Strategy
- Linesearch Trials Limit
- LP Algorithm
- LP Penalty Formulation
- LP Presolve
- Objective Reduction
- QP and QCQP Initialization Strategy
- Solution Progress Iterations
- Solution Progress Tolerance
- Hessian
- Interior Point
- Barrier Corrector Steps Limit
- Barrier Enable Conic
- Barrier Globalize
- Barrier Maximum Mu
- Barrier MPEC Heuristic
- Barrier Parameter Strategy
- Barrier Penalty Constraint Strategy
- Barrier Penalty Parameter Strategy
- Barrier Refinement
- Barrier Relax Constraints
- Barrier Slack Bound Push
- Barrier Switch Objective
- Barrier Switch Rule
- Barrier Watchdog
- Conjugate Gradient Iteration Limit
- Conjugate Gradient Memory Limit
- Conjugate Gradient Preconditioner
- Conjugate Gradient Stopping Tolerance
- Crossover Iterations Limit
- Direct Step Interval
- Feasible Mode
- Feasible Mode Activation Tolerance
- Initial Barrier Parameter Value
- Initial Barrier Penalty Value MPEC
- Initial Point Strategy
- Linear System Form Used
- Linear System Memory Usage
- Refactorization Limit
- MIP
- Integrality
- Maximal Number of Nodes
- Maximal Number of Subproblem Solves
- MIP Algorithm
- MIP Branching Rule
- MIP GUB Branch
- MIP Heuristic
- MIP Heuristic Diving
- MIP Heuristic Feasibility Pump
- MIP Heuristic Iteration Limit
- MIP Heuristic Large Neighborhood Search
- MIP Heuristic Local Search
- MIP Heuristic MPEC
- MIP Heuristic Strategy
- MIP Heuristic Terminate
- MIP Implications
- MIP Integer Variables Relaxable
- MIP Integer Variables Strategy
- MIP Method
- MIP MISQP Heuristic
- MIP Multistart
- MIP Objective Cutoff Value
- MIP Pseudo Cost Initialization
- MIP Restart
- MIP Rounding
- MIP Start Algorithm
- MIP Terminate
- Node Algorithm
- Node Selection
- Node Selection_Direction
- Strong Branching Candidates Limit
- Strong Branching Iteration Limit
- Strong Branching Level
- MIP Cuts
- Multistart
- Parallel
- Presolve
- Reporting
- Termination
- Tolerances
- Tuner
- Debugging
- General
- MINOS
- ODH-CPLEX
- ODH-CPLEX
- ODH to AIMMS Mapping
- AIMMS to ODH Mapping
- Parallel Execution
- Parameter File
- Specifying Model Structure
- ODH-CPLEX Options
- General
- Advanced
- Heuristics
- First Feasible Heuristic
- First Feasible Heuristic Continue
- First Feasible Heuristic Effort Level
- First Feasible Heuristic Shift
- Recurse
- Recurse Decomposition Method
- Recurse Iteration Limit
- Recurse Iteration Limit Solution
- Recurse Minimum Iterations
- Solution Improvement Heuristic Mode
- Solution Improvement Heuristic Penalty
- Solution Improvement Heuristic Strategy
- Parallel
- Logging
- CPLEX General
- CPLEX Barrier
- CPLEX MIP
- Backtrack
- Branch
- Difference Objective
- Integrality
- Maximal Number of Nodes
- MIP Basis
- MIP Candidate List
- MIP Dive Strategy
- MIP Emphasis
- 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 Parallel Threads
- Number of Repair Attempts
- Number of Simplex Iterations
- Probing Time
- Probing Time Deterministic
- Relative Difference Objective
- Select Variables
- Selection of Nodes
- Working Memory Limit
- Write MIP Starts
- CPLEX MIP Advanced
- CPLEX MIP Cuts
- BQP Cuts
- Clique Cuts
- Cover Cuts
- Cut Generation Limit
- Cut Limit
- Cuts Factor
- Disjunctive Cuts
- Flow Cover Cuts
- Flow Path Cuts
- Gomory Cuts
- Gomory Cuts Candidate Limit
- Gomory Cuts Pass Limit
- GUB Cover Cuts
- Implied Bound Cuts
- Lift and Project Cuts
- Local Implied Bound Cuts
- MCF Cuts
- MIP Number of Cut Passes
- Mixed Integer Rounding Cuts
- Node Cuts
- RLT Cuts
- Zero Half Cuts
- CPLEX MIP Heuristics
- CPLEX MIP Preprocessing
- CPLEX MIP Solution Polishing
- CPLEX MIP Solution Pool
- CPLEX Network
- CPLEX Parallel
- CPLEX Preprocessing
- CPLEX Quadratic
- CPLEX Simplex
- CPLEX Logging
- PATH
- PATH
- AIMMS to PATH Mapping
- PATH to AIMMS Mapping
- PATH Options
- General
- Advanced
- Crash
- Limits
- Reporting
- Create Status File
- Output Crash Iterations
- Output Crash Iterations Frequency
- Output Errors
- Output Final Degeneracy Statistics
- Output Final Point
- Output Final Point Statistics
- Output Final Scaling Statistics
- Output Final Statistics
- Output Final Summary
- Output Initial Point
- Output Initial Point Statistics
- Output Initial Scaling Statistics
- Output Initial Statistics
- Output Linear Model
- Output Major Iterations
- Output Major Iterations Frequency
- Output Minor Iterations
- Output Minor Iterations Frequency
- Output Model Statistics
- Output Options
- Output Preprocess
- Output Restart Log
- Output Warnings
- SNOPT
- SNOPT
- SNOPT to AIMMS Mapping
- AIMMS to SNOPT Mapping
- Description of SNOPT Algorithm
- SNOPT Options
- Advanced
- Calling Crash Procedure
- Check Frequency
- Crash Tolerance
- Elastic Weight
- Expand Frequency
- Factorization Frequency
- Function Precision
- Gaussian Elimination Tolerance
- Hessian Frequency
- Hessian Memory
- Hessian Updates
- Linesearch Tolerance
- LU Density Tolerance
- LU Factor Tolerance
- LU Pivoting Method
- LU Singularity Tolerance
- LU Update Tolerance
- Penalty Parameter
- Pivot Tolerance
- Proximal Point Method
- Feasibility
- Limits
- Reporting
- Scaling
- SQP Method
- Advanced
- XA
- XA
- XA to AIMMS Mapping
- AIMMS to XA Mapping
- Troubleshooting
- XA Options
- Advanced
- General
- Simplex
- MIP
- Basis in Memory
- Dual Simplex
- Lower Integer Tolerance
- Maximal Number of Generated Nodes
- Maximal Number of Nodes
- MIP Basis
- MIP Branch Order
- MIP Postsolve
- MIP Strategy
- MIP Strategy Branching Priorities
- MIP Strategy Estimate Integer Solution
- MIP Strategy Split Node List
- MIP Update
- Percentage Fixed Integer Variables
- Selection of Nodes
- Stop After
- Stop Unchanged
- Tree Depth
- Tree Time
- Upper Integer Tolerance
- Memory
- Logging
- AIMMS IDE
- Miscellaneous