MOP (Many OPtimizations)

MOP is a flexible and modular single or multi-objetive optimization solver for contiguous and discrete problems. Through its default pipeline you can define your own custom problem and choose any supported solver combination.

Current state

Testing and documentation are scarce and the project itself is in experimental phase. Nevertheless, things seems to work in general.

Example

Choose your solver combination, provide desirable parameters and build your objectives and domains with or without constraints.

Take a look at this CONSTR problem from NSGA-II (Deb et al., 2000).

• MOP | Library
• MOP - Scripting | Lua
• MOP - CLI | WIP

Solvers

Official built-in solvers.

• [ ] Spea2 (Mostly done)
• [ ] Tabu search (WIP)

Objectives

Some ideas to guide development.

Short-term objectives

• [ ] Add more tests
• [ ] Complete API documentation
• [ ] Enchance integrity and robustness
• [ ] Finish CLI interface
• [ ] Finish benchmark suite
• [ ] WASM / no_std

Mid-term objectives

• [ ] Add more solvers

Humble long-long-term objectives

• [ ] Support linear programming
• [ ] Support quadratic programming
• [ ] Be at least as fast as commercial solvers