pymoo

Solve single- and multi-objective optimization problems with evolutionary algorithms in Python.

1|Updated Jan 14, 2026
One-click install
npx skills add https://github.com/Sologa/codex-pipeline --skill pymoo-sologa
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: pymoo
Source: https://github.com/Sologa/codex-pipeline/tree/main/.codex/skills/pymoo
Command: npx skills add https://github.com/Sologa/codex-pipeline --skill pymoo-sologa

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill tackles complex optimization challenges where multiple, often conflicting, objectives need to be optimized simultaneously, providing a range of optimal trade-off solutions.

Core Features & Use Cases

  • Multi-Objective Optimization: Solve problems with 2, 3, or many objectives using state-of-the-art algorithms like NSGA-II and NSGA-III.
  • Constraint Handling: Effectively manage problems with complex feasibility constraints.
  • Custom Problem Definition: Define and optimize your own unique engineering or scientific problems.
  • Use Case: Optimize a product design to simultaneously minimize cost, maximize performance, and minimize environmental impact, exploring the trade-offs between these goals.

Quick Start

Use the pymoo skill to optimize the zdt1 problem using the nsga2 algorithm for 200 generations.

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

Multi-objective optimization in Python is handled by applying evolutionary algorithms like NSGA-II to find optimal trade-offs. This framework allows you to define custom problems and generate a set of Pareto-optimal solutions for conflicting objectives.

When do I need many-objective optimization instead of standard multi-objective techniques?

Many-objective optimization is needed when solving problems with more than three objectives simultaneously. You can use algorithms like NSGA-III to effectively navigate the complex solution space and find optimal trade-offs for high-dimensional engineering design problems.

Can I define custom engineering design problems with complex feasibility constraints?

Custom engineering design problems with complex feasibility constraints can be defined directly within the framework. Constraint handling mechanisms ensure that generated evolutionary algorithm solutions adhere to your specific scientific research requirements.

What is the best way to optimize product design for cost, performance, and environmental impact?

The best way to optimize product design for cost, performance, and environmental impact is using multi-objective evolutionary algorithms. This approach simultaneously explores trade-offs between conflicting goals to generate a range of optimal design configurations.

How does constraint handling work in evolutionary algorithms for optimization?

Constraint handling in evolutionary algorithms works by evaluating solution feasibility against defined limits during optimization. This ensures generated trade-off solutions respect complex engineering constraints while still converging towards optimal objectives.

Does this framework support single-objective optimization as well as many-objective problems?

The framework supports single-objective optimization alongside multi-objective and many-objective problems. It provides a comprehensive environment to apply various evolutionary algorithms to diverse scientific research and engineering design challenges.