Solving convex MINLP problems with AIMMS

This document describes the Quesada and Grossman algorithm that is implemented in AIMMS to solve convex MINLP problems. We benchmark this algorithm against AOA which implements the classic outer approximation algorithm.

View the PDF file: AIMMS-Whitepaper-COA.pdf

Last Updated: September, 2020