Introduction - If you have any usage issues, please Google them yourself
MIDACO is a solver for general optimization problems. MIDACO can be applied to continuous (NLP), discrete/integer (IP) and mixed integer (MINLP) problems. Problems may be restricted to equality and/or inequality constraints. MIDACO is suitable for problems with up to several hundreds to some thousands of optimization variables. MIDACO implements a derivative-free, heuristic algorithm that treats the problem as black-box which may contain critical function properties such as non-convexity, discontinuities or stochastic noise.