pymoo

Solve multi-objective optimization problems with NSGA-II/III and Pareto-front analysis.

15|2|Updated Dec 17, 2025
One-click install
npx skills add https://github.com/rubensliv/k-dense-ai --skill pymoo-rubensliv
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: pymoo
Source: https://github.com/rubensliv/k-dense-ai/tree/main/scientific-skills/pymoo
Command: npx skills add https://github.com/rubensliv/k-dense-ai --skill pymoo-rubensliv

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires numpy, matplotlib, and includes scripts (resource) and references (resource) components.

What problem does it solve?

Pymoo enables teams to perform robust multi-objective optimization by offering a consistent interface, a suite of algorithms, and ready-made benchmarks to explore trade-offs across design spaces.

Core Features & Use Cases

  • Unified minimize() interface for single- and multi-objective optimization across continuous, integer, and permutation problems.
  • Supports state-of-the-art algorithms (NSGA-II, NSGA-III, MOEA/D) and constraint handling with standard test problems (ZDT, DTLZ, WFG).
  • Reproducible tutorials and scripts to benchmark and visualize Pareto fronts and decision-making.

Quick Start

Run the included NSGA-II multi-objective example to view Pareto fronts and comparative visualizations.

Frequently Asked Questions about pymoo

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I solve multi-objective optimization problems with conflicting objectives?

Multi-objective optimization handles conflicting objectives by computing trade-offs across design spaces. This Skill uses algorithms like NSGA-II, NSGA-III, and MOEA/D through a unified minimize() interface to find Pareto fronts.

What is a Pareto front and how do I visualize it for engineering design trade-offs?

A Pareto front represents the set of non-dominated optimal solutions where improving one objective degrades another. You can visualize these trade-offs using the included reproducible scripts and matplotlib outputs for engineering design and product optimization workflows.

Can I use NSGA-II and MOEA/D for constrained optimization with continuous and integer variables?

Yes, the unified minimize() interface supports NSGA-II, NSGA-III, and MOEA/D for constrained optimization across continuous, integer, and permutation problems. It includes built-in constraint handling to manage complex design spaces.

How do I benchmark multi-objective optimization algorithms using ZDT and DTLZ test problems?

You can benchmark multi-objective optimization algorithms by running them against standard test problems like ZDT, DTLZ, and WFG. The included reproducible scripts and tutorials allow you to compare algorithm performance and visualize resulting Pareto fronts.

Do I need numpy and matplotlib to run multi-objective optimization workflows?

Yes, numpy and matplotlib are required dependencies for executing multi-objective optimization workflows. Numpy handles numerical array operations, while matplotlib provides the visualization capabilities needed to plot and analyze Pareto fronts.