Solve single- and multi-objective optimization problems with NSGA-II/III and MOEA/D.
npx skills add https://github.com/jackspace/ClaudeSkillz --skill pymoo
Please help me install this Agent Skill. Skill: pymoo Source: https://github.com/jackspace/ClaudeSkillz/tree/main/skills/scientific-pkg-pymoo Command: npx skills add https://github.com/jackspace/ClaudeSkillz --skill pymoo
Pymoo offers a unified interface for solving single- and multi-objective optimization problems, with state-of-the-art algorithms (NSGA-II/III, MOEA/D), constraint handling, and visualization.
High-intent search queries and answers about installing and using this skill.
Multi-objective optimization balances competing objectives to find trade-off solutions. Pymoo provides a unified minimize() interface with state-of-the-art algorithms like NSGA-II, NSGA-III, and MOEA/D to define problems, select algorithms, and extract Pareto-front solutions representing optimal trade-offs.
NSGA-II and NSGA-III are genetic algorithms for multi- and many-objective problems respectively; NSGA-III scales better to 4+ objectives. MOEA/D decomposes problems into single-objective subproblems. Pymoo implements all three, letting you choose based on your problem's objective count and computational budget.
Yes, pymoo supports constrained multi-objective optimization. You define constraints within your problem formulation, and the algorithms handle feasibility during evolution. This lets you find Pareto-front solutions that satisfy engineering design constraints.
Pymoo includes rich visualization options to plot Pareto fronts and trade-offs. After solving, inspect result.X (design variables) and result.F (objectives), then use the built-in plotting capabilities to compare solutions across different objective dimensions.
Yes, pymoo provides standard benchmarks like ZDT and DTLZ problems. These let you test and validate algorithm performance on known test cases before applying pymoo to your own engineering design problems.
Pymoo supports customization of operators (crossover, mutation, selection) and workflow assembly. You can modify algorithm behavior to fit domain-specific requirements or compare different operator combinations on your optimization problems.
NVIDIAModel quadratic programming problems with objectives, variables, and linear constraints for cuOpt.
jkitchinOptimize multiple conflicting objectives in Python using pymoo, platypus, or DEAP.
jimmc414Solve single, multi, and many-objective optimization problems with evolutionary algorithms.
SologaSolve single- and multi-objective optimization problems with evolutionary algorithms in Python.
