A mathematical implementation of dynamic MOO problems for a practical problem typically involving conflicting objectives.
Project description
dynMOOPs
A mathematical implementation of the classical Dynamic Multi-Objective Optimization Problems (dynMOOPs) for practical problems
that typically involves a set of conflicting objectives. In addition, the method allows penalty on premiumization (typically for costing) and
appreciations (typically for objectives involving maximization) methods for control.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Close
Hashes for dynamic_moops-0.0.1.dev0-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 6cbbe99cabd1caefd312a39f144929a7b78a131b1eed2aca307642b107211a00 |
|
| MD5 | 2fb749f507d4c25ece34d5651fe44630 |
|
| BLAKE2b-256 | 499df79dd9733149daf61040392b0cad827d3fb6553263856f8d89905a75e696 |
