pymoo

Solve single-objective, multi-objective, and constrained optimization problems with pymoo.

74|5|Updated Dec 10, 2025
One-click install
npx skills add https://github.com/dralkh/seerai --skill pymoo-dralkh
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: pymoo
Source: https://github.com/dralkh/seerai/tree/main/skills/pymoo
Command: npx skills add https://github.com/dralkh/seerai --skill pymoo-dralkh

SYSTEM DOCUMENTATION & REQUIREMENTS

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

What problem does it solve?

Pymoo helps you solve optimization problems with one or many conflicting objectives, especially when you need Pareto-optimal trade-offs, constraint handling, and repeatable benchmark comparisons.

Core Features & Use Cases

  • Multi-objective search: Run NSGA-II, NSGA-III, MOEA/D, SPEA2, and related methods to explore trade-offs.
  • Custom problem modeling: Define single-objective, many-objective, constrained, mixed-variable, or dynamic problems with a consistent interface.
  • Analysis and decision support: Visualize Pareto fronts, compare solutions, and apply multi-criteria decision making after optimization.
  • Use case: A researcher can model a constrained engineering design problem, optimize it, inspect the front, and pick a preferred solution from the candidates.

Quick Start

Use the pymoo skill to optimize your problem with an appropriate algorithm, then visualize the resulting Pareto front and select the best trade-off for your goal.

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 constraints in Python?

Multi-objective constrained optimization is solved by defining a custom problem interface and applying algorithms like NSGA-II or NSGA-III to find Pareto-optimal trade-offs. This handles conflicting objectives and returns candidate solutions for decision making.

What is the best way to visualize a Pareto front after multi-objective optimization?

Pareto front visualization requires plotting the objective space of resulting non-dominated solutions using matplotlib. This helps analyze trade-offs and select a preferred solution from the optimized candidates.

Can I run mixed-variable optimization where some parameters are discrete and others continuous?

Mixed-variable optimization supports combining discrete and continuous parameters within a single custom problem definition. Algorithms like NSGA-II explore this mixed search space to find optimal trade-offs across all variable types.

Does multi-objective search support parallel evaluation for computationally expensive engineering design problems?

Parallel evaluation is supported for computationally expensive engineering design problems to accelerate multi-objective search. This enables efficient benchmark studies and optimization workflows by distributing objective function calculations.

How do I choose between NSGA-II, NSGA-III, and MOEA/D for many-objective optimization?

Choosing between NSGA-II, NSGA-III, and MOEA/D depends on the number of objectives; NSGA-III and MOEA/D use reference directions for many-objective problems, while NSGA-II suits fewer objectives. Compare algorithms to select the best approach for your specific Pareto-front analysis.