Solving a MINLP Optimization Problem

22 次查看（过去 30 天）
Israa Ahmed
Israa Ahmed 2021-8-9
回答： Alan Weiss 2021-8-10
I have a mixed integer nonlinear optimization problem containing "log" function, and by the way it's convex if we relaxed the integer variables.
Can I solve it using Matlab Optimization toolbox efficiently or there will be some issues?
Is there a difference in solving such optimization problems if I used problem-based and used solver-based approaches?

请先登录，再回答此问题。

采纳的回答

Alan Weiss
Alan Weiss 2021-8-10
There are two MINLP solvers in Global Optimization Toolbox: ga and surrogateopt. Either should work for you. The surrogateopt solver is primarily for time-consuming functions. Both solvers work best on relatively low-dimensional problems, up to 100 variables or so, but there are no built-in limits, so you can try larger problems.
There is also an example showing how intlinprog can sometimes be used iteratively to solve otherwise convex mixed-integer problems: Mixed-Integer Quadratic Programming Portfolio Optimization: Problem-Based or the nearly identical Mixed-Integer Quadratic Programming Portfolio Optimization: Solver-Based.
Good luck,
Alan Weiss
MATLAB mathematical toolbox documentation

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Get Started with Optimization Toolbox 的更多信息

标签

产品


版本

R2021a

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by