Calculate shadow price of capacity
Calculate lumpy, discrete capacity shadow prices by re-optimizing a scenario-valued initiative portfolio after a governed increment to each resource, with CVaR penalty and explicit exact or heuristic solver status.
What it's for
Shows which scarce engineering capability is economically worth expanding and what one decision-sized increment could unlock.
What you give it
Inputs split into evidence read from your connected systems, calibration your team owns, and numerical controls that affect precision but never the result's meaning.
| Field | Type | Role | Required |
|---|---|---|---|
| initiatives | array of objects (3 fields) ≥ 1 item | Evidence | Yes |
| max_detail_rows | integer ≥ 1, ≤ 500 | Numerical control | Optional |
| maximum_exact_states | integer ≥ 2, ≤ 16777216 | Numerical control | Optional |
| resources | array of objects (3 fields) ≥ 1 item | Evidence | Yes |
| risk_aversion | number ≥ 0 | Your calibration | Optional |
| scenario_probabilities | array of number ≥ 2 items | Evidence | Yes |
| tail_probability | number ≥ 0.001, ≤ 0.5 | Your calibration | Optional |
Each initiatives
record
| Field | Type | Required |
|---|---|---|
| id | string (non-empty) | Yes |
| net_value_scenarios | array of number (≥ 2 items) | Yes |
| resource_requirements | object | Yes |
{
"initiatives": [
{
"id": "platform",
"net_value_scenarios": [
90,
100
],
"resource_requirements": {
"backend": 2,
"design": 1
}
},
{
"id": "growth-a",
"net_value_scenarios": [
50,
60
],
"resource_requirements": {
"backend": 1,
"design": 1
}
},
{
"id": "growth-b",
"net_value_scenarios": [
45,
55
],
"resource_requirements": {
"backend": 1,
"design": 1
}
}
],
"resources": [
{
"capacity": 2,
"capacity_increment": 1,
"id": "backend"
},
{
"capacity": 10, Truncated for display — the full payload is 54 lines.
What you get back
This is the actual output of running the example above — computed by the same function the platform calls, not an illustration.
{
"assumptions": [
"Initiatives are indivisible, requirements and capacities share one planning horizon, scenario columns are aligned, and net values include every incremental cost and opportunity cost represented by the decision.",
"A discrete shadow price is the re-optimized objective gain from the declared capacity increment divided by that increment; it may be zero or discontinuous and is not a continuous linear-program dual.",
"Exact mode certifies the represented subset search only; heuristic-mode prices are policy-dependent lower-quality estimates without an optimality certificate and must not justify hiring, procurement, or person-level action alone."
],
"configuration": {
"initiative_count": 3,
"maximum_exact_states": 262144,
"resource_count": 2,
"risk_aversion": 0.5,
"scenario_count": 2,
"solver_mode": "exact_enumeration",
"tail_probability": 0.1
},
"decision": "capacity_shadow_prices_exact",
"method": "discrete_portfolio_reoptimization_shadow_price_v1",
"resource_diagnostics": [
{
"augmented_selected_initiative_ids": [
"platform",
"growth-a"
],
"baseline_slack": 0,
"baseline_usage": 2,
"capacity": 2,
"capacity_increment": 1,
"discrete_shadow_price_per_capacity_unit": 67.5,
"marginal_risk_adjusted_portfolio_value": 67.5,
"portfolio_changes_after_increment": true,
"resource_id": "backend"
},
{
"augmented_selected_initiative_ids": [
"growth-a",
"growth-b"
],
"baseline_slack": 8,
"baseline_usage": 2,
"capacity": 10,
"capacity_increment": 1,
"discrete_shadow_price_per_capacity_unit": 0,
"marginal_risk_adjusted_portfolio_value": 0,
"portfolio_changes_after_increment": false, Truncated for display — the full payload is 61 lines.
How it works
Constrained optimization — Pick the best feasible option under real limits — budget, headcount, dependencies, capacity — rather than ranking a list and hoping it fits.
- 1 Freeze indivisible initiatives, complete aligned net-value scenarios, resource requirements, capacities, and a decision-relevant increment for every capacity pool.
- 2 Optimize the baseline portfolio under expected value minus the governed CVaR loss penalty, add one capacity increment at a time, re-optimize, and divide objective gain by the increment.
- 3 Treat zero and discontinuous prices as legitimate lumpy-portfolio results and use heuristic-mode prices only as uncertified screening estimates requiring exact or operational follow-up.
Before you trust it
Every tool in the catalog ships with the conditions under which its answer is meaningful — and the conditions under which it should abstain instead of guessing.
Assumptions & guardrails
- Objectives use commensurable locally governed value units, constraints reflect real feasibility, and uncertainty covers plausible adverse inputs.
- Requirements and capacity share one horizon, initiatives are indivisible and independent except through submitted resources/scenarios, net value is complete, and scenario columns represent the same joint future.
- The recommendation is optimal only for its stated objective, feasible set, evidence, and solver guarantee; it is not a universal management optimum.
- This is a discrete re-optimization price, not a continuous LP dual or wage; it cannot alone justify hiring, procurement, outsourcing, or action toward a named person.
Minimum evidence
- resources: at least 1 rows/items
- initiatives: at least 1 rows/items
- scenario_probabilities: at least 2 rows/items
How to validate it
Backtest the chosen action against simple feasible baselines on held-out scenarios, sweep costs/constraints/risk tolerance, and require constraint feasibility under adverse inputs.
Calibrating it to your org
Same for everyone
The mathematical kernel, validation rules, method version, and JSON output semantics are organization-independent; no tenant-trained coefficients or company benchmark is embedded in the function.
Specific to you
- aligned initiative-by-scenario net-value matrix and resource-requirement matrix under one planning horizon
- resource units and capacity perimeter, initiative indivisibility, capacity increments, value/cost completeness, scenario identity/probabilities, risk aversion, tail, solver limit, and heuristic promotion policy
Calibration workflow
- 1 Define the management decision, target outcome, aggregate unit, privacy boundary, cadence, and prediction/intervention horizon for this organization.
- 2 Build a tenant-scoped historical cohort using only information available before each prediction or decision; preserve zero periods, censoring, assignment probabilities, and unresolved outcomes when the method requires them.
- 3 Estimate statistical parameters on training history, but obtain costs, utilities, risk tolerance, practical-effect thresholds, capacity, and policy constraints from accountable decision owners.
- 4 Validate on later time windows or held-out aggregate units at the deployment grain, against a simple baseline and the function-specific validation strategy.
- 5 Deploy only if the returned decision clears evidence, overlap, calibration, robustness, and guardrail checks; warning, unsupported, schema-gap, and fallback decisions are abstentions.
- 6 Monitor realized outcomes, data drift, coverage, and decision regret; recalibrate at a governed cadence or after a detected regime/definition change, never merely because a stakeholder dislikes the result.
Call it from your AI
You don't wire up 388 tools in your MCP client. The GitRevio MCP server exposes 18 tools, three of which let an agent search the catalog, read a tool's schema, and run it — so the assistant finds this one on its own.
gitrevio_capabilities_search
{ "q": "calculate lumpy discrete capacity shadow prices" }
→ finds "calculate_shadow_price_of_capacity"
gitrevio_capability_describe
{ "capability_id": "calculate_shadow_price_of_capacity" }
→ returns the input schema and agent guidance shown on this page
gitrevio_capability_run
{ "capability_id": "calculate_shadow_price_of_capacity", "arguments": { ... } }
→ returns the result shown above Works in Claude Desktop, Claude Code, Cursor, Cline, Continue.dev, Goose and Aider. See the MCP server.
Related tools
Optimize sequence dependent roadmap
Optimize a dependency-feasible roadmap sequence under category setup time, execution duration and cost, aligned uncertain value, and exponential value decay, with bounded exact enumeration and visible heuristic fallback.
Value dependency unblocking
Value shortening one blocker by propagating aligned duration scenarios through a dependency DAG, repricing earlier completion under task-specific value decay, and mixing unblock success or failure after cost.
Allocate attention budget
Use exact knapsack optimization to allocate limited expert-review time by expected avoided loss.
Allocate capacity by marginal value
Allocate indivisible aggregate capacity across initiative-specific diminishing marginal-value scenario curves, activation thresholds, hard minimum commitments, unit cost, and portfolio CVaR with discrete next-unit value and explicit solver certainty.
Allocate capacity nash bargaining
Allocate discrete shared capacity by weighted Nash social welfare over concave team utility curves, with disagreement guarantees and a utilitarian counterfactual.
Calculate engineering runway
Compare three-point roadmap effort with three-point team capacity and expose unfunded commitments.