optimization

Name: optimization
Availability: InStock
Author: the-thinker

Formalize decision problems as optimization tasks with objectives and constraints.

6|Updated Apr 16, 2026

Search Tags:#optimization #constraints #decision-making #multi-objective #duality #lagrangian #kkt

Ready to run

npx skills add https://github.com/the-thinker0/math-skill --skill optimization-the-thinker0

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: optimization
Source: https://github.com/the-thinker0/math-skill/tree/main/skills/optimization
Command: npx skills add https://github.com/the-thinker0/math-skill --skill optimization-the-thinker0

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Formalize decision problems as optimization tasks to identify the best feasible choices under given constraints and trade-offs.

Core Features & Use Cases

Define objectives, constraints, and feasible regions to frame decisions as optimization problems.
Analyze single- and multi-objective scenarios (Pareto fronts) and apply convex analysis, duality, and Lagrangian methods to reveal problem structure.
Apply to resource allocation, scheduling, budgeting, and strategy optimization in research and daily life.

Quick Start

Describe my decision problem, define the objective and constraints, and outline a plan to find the best feasible solution.

Frequently Asked Questions about optimization

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

FAQPage Schema

How do I formalize a decision problem with multiple competing objectives and constraints?▼

Multi-objective optimization frames competing goals as a Pareto front to reveal trade-offs. You define explicit objective functions and constraint sets, then apply convex analysis to identify feasible choices that balance multiple priorities simultaneously.

When do I need Lagrangian methods and KKT conditions for constrained optimization?▼

Lagrangian methods and KKT conditions are needed when solving constrained optimization problems to uncover underlying structure. They help identify optimal feasible choices by analyzing duality and stationarity conditions under inequality and equality constraints.

How do I use duality to analyze the structure of a resource allocation problem?▼

Duality transforms a primal resource allocation problem into a dual problem to reveal hidden structure and bounds. Analyzing both primal and dual formulations uncovers shadow prices and sensitivities, providing deeper insights into optimal resource distribution.

What is the best way to set up a feasibility analysis for budgeting and scheduling trade-offs?▼

Feasibility analysis for budgeting and scheduling requires defining explicit constraint sets and objective functions. By mapping out the feasible region and applying convex analysis, you isolate viable schedules that satisfy budget limits while maximizing efficiency.

Can I apply convex analysis to non-linear decision-making problems in daily life?▼

Convex analysis applies to non-linear decision-making when objectives and constraints form a convex set. This ensures any local optimum found is globally optimal, making it highly reliable for resolving daily life trade-offs and complex multi-objective scenarios.