linear-programming

A skill for building, solving, proving, or reviewing linear-programming models, which optimize a linear objective subject to linear constraints.

In plain words
What is it for?
Use it for feasibility, boundedness, simplex reasoning, graph and flow models, duality, certificates, complementary slackness, and integer-programming caveats.
Why use it?
It helps ensure that the mathematical model represents the real problem and that an alleged optimum can be justified.

Skill for Claude CodeCodex

Install

Getting it into your agent

One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.

agentmods
npx agentmods add skills/arcadi4/nerdy/linear-programming
Any agent
npx skills add Arcadi4/nerdy --skill linear-programming
Clone the repo
git clone --depth 1 https://github.com/Arcadi4/nerdy

Made for: Claude Code, Codex.

Per session 63 Skills are progressive disclosure: only the name and description are preloaded; the body loads when the skill is used.
When invoked 4,302 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. Scan, not verified.
Origin original No closer match found in the catalogue.
Token cost

What it costs to keep this loaded

Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.

ModelPer sessionOnce invoked
Fable 5 $0.00063 $0.04302
Opus 5 $0.00032 $0.02151
Sonnet 5 $0.00013 $0.00860
Haiku 4.5 $0.00006 $0.00430

Measured yesterday against content hash 196599149e65, method: parsed. Prices are Anthropic first-party input rates as of 2026-08-30, from the pricing page.

Security

Grade A, and why

linear-programming scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured yesterday.

A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.

Nothing flagged

None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.

clrs/linear-programming/SKILL.md · 436 lines

How it starts

The opening of the file, as written. The whole thing — 436 lines — stays where its author put it; the contents beside it link to each section on GitHub.

Linear Programming

Overview

Linear-programming answers are modeling and certificate problems before they are solver problems. First identify decisions, linear constraints, objective direction, feasibility status, and the proof certificate that would convince a skeptical reader the optimum is correct.

Core principle: an LP formulation is useful only when every variable has a real-valued meaning, every constraint preserves the original feasible set, the objective direction matches the bound semantics, and optimality can be certified by duality or complementary slackness.

Shared Parent Conventions

  • Follow the parent clrs skill for mathematical formatting: every expression, inequality, matrix relation, objective value, and asymptotic bound belongs in a display LaTeX block.
  • Keep tables verbal. Put standard forms, duals, graph constraints, and certificate equations in display blocks adjacent to the table instead of inside table cells.
  • Use shortest-paths for ordinary shortest-path algorithms, maximum-flow for augmenting-path and cut mechanics, and this skill when the task asks for LP formulation, duality, feasibility, or solver-based modeling.
  • Do not announce that you are using this skill. Deliver the polished formulation, proof, or review directly.

When to Use

Use this skill for:

  • turning a resource-allocation, graph, flow, matching, shortest-path, or scheduling-style problem into a linear program;
  • converting between arbitrary LP descriptions and the chapter's maximization standard form;
  • deciding whether a model is feasible, infeasible, bounded, unbounded, or missing constraints;
  • explaining simplex geometry, vertex optimality, ellipsoid methods, interior-point methods, or solver choice;
  • writing primal-dual pairs, weak-duality upper bounds, equality certificates, strong-duality arguments, or complementary-slackness checks;
  • distinguishing continuous LP relaxations from integer linear programs and avoiding false polynomial-time claims.

Read the full file on GitHub · 436 lines

Changes

What this file has done since we first saw it

Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.

  1. yesterday First seen · 436 lines · 63 tokens per session scan A 196599149e65

Subscribe to this mod's changes

linear-programming is a skill published in the GitHub repository Arcadi4/nerdy (7 stars, last pushed 4mo ago), licensed MIT. It adds 63 tokens to every session and 4,302 once invoked, about $0.0003 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.