pymoo

Solve multi-objective and constrained optimization problems in Python with pymoo.

Updated Jul 1, 2026
One-click install
npx skills add https://github.com/jasrajtulsi/GRAD-SCOPE --skill pymoo-jasrajtulsi
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: pymoo
Source: https://github.com/jasrajtulsi/GRAD-SCOPE/tree/main/.claude/skills/pymoo
Command: npx skills add https://github.com/jasrajtulsi/GRAD-SCOPE --skill pymoo-jasrajtulsi

SYSTEM DOCUMENTATION & REQUIREMENTS

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

What problem does it solve?

This Skill helps you solve optimization problems with one or many competing objectives, especially when you need to compare trade-offs, handle constraints, and understand how an algorithm is progressing.

Core Features & Use Cases

  • Single-objective search: Run genetic and evolutionary optimization for classic continuous problems.
  • Multi-objective optimization: Find Pareto fronts with NSGA-II for two or three objectives and NSGA-III for many-objective problems.
  • Custom problems and constraints: Define your own objective functions, encode inequality or equality constraints, and evaluate mixed decision variables.
  • Decision support and visualization: Compare candidate solutions, normalize objective values, and inspect fronts with scatter plots, parallel coordinates, and petal diagrams.
  • Use Case: You have a Python design problem with cost, performance, and reliability targets, and you want to generate a set of feasible trade-off solutions instead of a single answer.

Quick Start

Use the pymoo skill to model my optimization problem, run an appropriate algorithm, and summarize the resulting Pareto-optimal solutions and trade-offs.

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

Multi-objective optimization in Python finds Pareto-optimal trade-offs for competing objectives using algorithms like NSGA-II. This Skill handles bi-objective and many-objective problems by evaluating custom functions, encoding constraint inequalities, and generating feasible solution sets.

How do I visualize the Pareto front to compare trade-offs between candidate solutions?

Visualize the Pareto front using scatter plots, parallel coordinates, and petal diagrams. This Skill normalizes objective values and renders visual comparisons so you can inspect feasible trade-offs and select the best candidate solutions from the optimization run.

When should I use NSGA-III instead of NSGA-II for many-objective optimization?

Use NSGA-III for many-objective optimization problems with more than three objectives, while NSGA-II suits two or three objectives. This Skill selects the appropriate algorithm based on your problem's objective count to find accurate Pareto fronts.

Can I define custom objective functions and mixed decision variables for engineering design problems?

Define custom objective functions and mixed decision variables directly in Python. This Skill models specific engineering scenarios by encoding your own equality and inequality constraints, evaluating mixed variable types, and running evolutionary optimization.

What's the best way to handle inequality and equality constraints during genetic algorithm search?

Handle inequality and equality constraints by encoding them within your custom problem definition. This Skill processes constraint violations during the genetic algorithm search to ensure generated solutions remain feasible across your specified objective trade-offs.

Does this approach support parallel evaluation for single-objective continuous optimization?

Parallel evaluation is supported for optimization tasks including single-objective continuous problems. This Skill accelerates genetic and evolutionary search by distributing fitness evaluations, then summarizes the resulting optimal or Pareto-optimal solutions.