Install any skill in seconds. Free to start, no credit card required.
Get Started Free →Maximize total portfolio value within constraints using Knapsack, Linear programming, Cost-benefit analysis, and NPV ranking methods.
.claude/skills/yogsoth-ai-value-maximization/SKILL.md| Test case | Without → With | Effect | Δ tokens | Δ turns |
|---|---|---|---|---|
| case-03 | ✗→✓ | ▲ Improved | 0% | 0% |
| case-08 | ✗→✓ | ▲ Improved | 62% | 0% |
| case-09 | ✗→✓ | ▲ Improved | -39% | 0% |
| case-10 | ✗→✓ | ▲ Improved | 15% | 0% |
| case-11 | ✗→✓ | ▲ Improved | 10% | 0% |
Select the portfolio subset that maximizes aggregate value (ROI, impact, utility) subject to resource constraints. Applies when the primary goal is getting the most out of a limited budget.
| Dimension | Target | |-----------|--------| | Candidates evaluated | 8-20 | | Constraints modeled | 1-5 | | Value metrics | 1-3 per candidate | | Solutions compared | >=5 |
| Field | Type | Description | |-------|------|-------------| | candidates | list | All candidate items with value and cost attributes | | constraints | list | Budget, capacity, or other binding constraints | | objective_function | string | How value is aggregated (sum, weighted sum, etc.) | | optimal_solution | list | Selected portfolio maximizing value | | value_achieved | number | Total value of selected portfolio |
| Tactic | When | |--------|------| | pareto-frontier-construction | Multiple value dimensions to trade off |
| SOP | Purpose | |-----|---------| | objective-definition | Define what "value" means and what constraints bind | | optimization-run | Run the optimization to find best portfolios | | pareto-visualization | Visualize value trade-offs if multi-objective | | selection-from-frontier | Pick final portfolio from candidates |
yamlstrategy: value-maximization selected_portfolio: - candidate: <name> value: <score> cost: <cost> total_value: <aggregate> total_cost: <aggregate> constraint_slack: <remaining budget> method_used: <knapsack|LP|NPV> confidence: <high|medium|low>
<!-- BEGIN available-tables (generated) -->
Optional, no fixed order; the final leaf is always a sop.
| Tactic | When to use | | --- | --- | | pareto-frontier-construction | Build the Pareto frontier from multi-objective optimization, visualize trade-offs, and select a portfolio from non-dominated solutions. |
Optional, no fixed order; the final leaf is always a sop.
| SOP | When to use | | --- | --- | | objective-definition | Define optimization objectives, constraints, and trade-off preferences from context and candidate information. | | optimization-run | Execute multi-objective optimization on candidates to produce a Pareto front of non-dominated solutions. | | pareto-visualization | Create visual representation of the Pareto frontier showing trade-offs between objectives with narrative explanation. | | selection-from-frontier | Select the final portfolio from the Pareto front by applying stakeholder preferences and decision criteria. |
<!-- END available-tables (generated) -->
| Case | Status | Duration (ms) | Turns | Tokens | Tool calls | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Without | With | Δ | Without | With | Δ | Without | With | Δ | Without | With | Δ | ||
case-01 | fail→fail | 63,613 | 41,433 | -35% | 1 | 1 | 0% | 5,119 | 9,035 | +76% | 0 | 0 | — |
case-02 | fail→fail | 42,731 | 29,056 | -32% | 1 | 1 | 0% | 8,295 | 6,113 | -26% | 0 | 0 | — |
case-03 | fail→pass | 34,575 | 33,538 | -3% | 1 | 1 | 0% | 7,038 | 7,032 | -0% | 0 | 0 | — |
case-04 | pass→pass | 40,044 | 44,034 | +10% | 1 | 1 | 0% | 8,260 | 9,001 | +9% | 0 | 0 | — |
case-05 | pass→pass | 26,957 | 32,007 | +19% | 1 | 1 | 0% | 3,436 | 5,907 | +72% | 0 | 0 | — |
case-06 | pass→pass | 48,910 | 48,476 | -1% | 1 | 1 | 0% | 8,264 | 9,005 | +9% | 0 | 0 | — |
case-07 | fail→fail | 19,914 | 15,745 | -21% | 1 | 1 | 0% | 3,367 | 4,671 | +39% | 0 | 0 | — |
case-08 | fail→pass | 10,633 | 11,937 | +12% | 1 | 1 | 0% | 1,322 | 2,140 | +62% | 0 | 0 | — |
case-09 | fail→pass | 39,506 | 20,317 | -49% | 1 | 1 | 0% | 7,682 | 4,714 | -39% | 0 | 0 | — |
case-10 | fail→pass | 23,459 | 28,683 | +22% | 1 | 1 | 0% | 5,615 | 6,482 | +15% | 0 | 0 | — |
case-11 | fail→pass | 21,305 | 18,797 | -12% | 1 | 1 | 0% | 3,643 | 4,003 | +10% | 0 | 0 | — |
case-17 | fail→pass | 16,687 | 25,764 | +54% | 1 | 1 | 0% | 3,615 | 5,375 | +49% | 0 | 0 | — |
case-12 | fail→fail | 8,593 | 5,594 | -35% | 1 | 1 | 0% | 1,906 | 2,136 | +12% | 0 | 0 | — |
case-13 | fail→pass | 5,556 | 12,649 | +128% | 1 | 1 | 0% | 1,268 | 2,452 | +93% | 0 | 0 | — |
case-14 | fail→fail | 19,747 | 37,581 | +90% | 1 | 1 | 0% | 3,388 | 8,984 | +165% | 0 | 0 | — |
case-15 | fail→fail | 15,573 | 16,003 | +3% | 1 | 1 | 0% | 2,630 | 3,503 | +33% | 0 | 0 | — |
case-16 | fail→pass | 24,384 | 23,009 | -6% | 1 | 1 | 0% | 4,486 | 4,631 | +3% | 0 | 0 | — |
case-18 | fail→fail | 20,117 | 23,328 | +16% | 1 | 1 | 0% | 3,357 | 5,643 | +68% | 0 | 0 | — |
case-19 | fail→pass | 11,464 | 6,411 | -44% | 1 | 1 | 0% | 1,485 | 2,193 | +48% | 0 | 0 | — |
case-20 | fail→pass | 13,716 | 12,983 | -5% | 1 | 1 | 0% | 2,876 | 2,344 | -18% | 0 | 0 | — |
case-21 | pass→pass | 10,912 | 8,889 | -19% | 1 | 1 | 0% | 1,179 | 1,609 | +36% | 0 | 0 | — |
case-22 | fail→pass | 18,174 | 29,791 | +64% | 1 | 1 | 0% | 3,960 | 6,375 | +61% | 0 | 0 | — |
case-23 | fail→fail | 13,655 | 7,100 | -48% | 1 | 1 | 0% | 1,977 | 2,525 | +28% | 0 | 0 | — |
DecimalAI ran this skill against gemini-3.6-flash twice over the same eval suite — once with the skill loaded and once without — and compared the two runs case by case. 23 cases were attempted. The headline lift of +48 percentage points is the difference between those two pass rates over the 23 comparable cases. 1 case got worse with the skill loaded, and it is included in that figure.
Without the skill loaded, the model failed this case. With it loaded, the same prompt on the same model passed. This is one improved case from the latest verified run; every case, including any that regressed, is in the table above.
Other measured skills in the registry, with their headline benchmark lift.