Solving Mixed-Integer Nonlinear Programming (MINLP) Problems

preview_player
Показать описание
In this webinar, we discuss how you can solve mixed-integer nonlinear programming (MINLP) problems in AIMMS. We discuss MINLP solvers (including BARON, Knitro and AOA) and talk about the algorithms used by these solvers. We address the pros and cons of each solver, and advise you on when to use each of them. Finally, we briefly discuss the AIMMS Presolver which can be used to improve the performance of these MINLP solvers.
Рекомендации по теме
Комментарии
Автор

Isn't Gurobi limited to quadratic objective functions? I don't think it is general enough for generic convex objective functions.

michaelslindon
welcome to shbcf.ru