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
Help & Feedback
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
Create a topic if there's something you don't like about this feature
Propose functionality by submitting a feature request
Not what you where looking for? Search the docs
Remember we also have Community support
Still having trouble ? Reach out to us