Solve robust multiobjective portfolio
Solve a budgeted dependency-safe portfolio against both scenario-probability ambiguity and every vertex of a bounded stakeholder-preference simplex, using governed utility anchors and returning practically nondominated supported tradeoffs.
What it's for
Finds initiatives that remain defensible across forecast error and legitimate stakeholder disagreement, while showing the exact priorities and scenarios that pressure the recommendation.
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 |
|---|---|---|---|
| budget | number ≥ 0 | Your calibration | Yes |
| initiatives | array of objects (5 fields) ≥ 1 item | Evidence | Yes |
| max_detail_rows | integer ≥ 1, ≤ 500 | Numerical control | Optional |
| maximum_exact_states | integer ≥ 2, ≤ 4194304 | Numerical control | Optional |
| minimum_robust_utility | number ≥ 0, ≤ 1 | Your calibration | Optional |
| nominal_scenario_probabilities | array of number ≥ 2 items | Evidence | Yes |
| objectives | array of objects (7 fields) ≥ 2 items | Evidence | Yes |
| total_variation_radius | number ≥ 0, ≤ 1 | Your calibration | Optional |
Each objectives
record
| Field | Type | Required |
|---|---|---|
| aspiration_portfolio_value | number | Yes |
| direction | one of "maximize", "minimize" | Yes |
| id | string (non-empty) | Yes |
| practical_utility_epsilon | number (≥ 0, ≤ 1) | Optional |
| unacceptable_portfolio_value | number | Yes |
| weight_max | number (≥ 0, ≤ 1) | Yes |
| weight_min | number (≥ 0, ≤ 1) | Yes |
{
"budget": 400000,
"initiatives": [
{
"cost": 400000,
"dependency_ids": [],
"exclusion_ids": [
"resilience"
],
"id": "growth",
"objective_scenarios": {
"resilience": [
10,
20,
30
],
"value": [
200000,
900000,
1500000
]
}
},
{
"cost": 300000,
"dependency_ids": [],
"exclusion_ids": [
"growth"
],
"id": "resilience",
"objective_scenarios": {
"resilience": [
70,
90,
100
],
"value": [
100000,
300000,
500000
]
}
},
{ Truncated for display — the full payload is 90 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.
{
"adversarial_case": {
"objective_weights": {
"resilience": 0.3,
"value": 0.7
},
"probability_shifts": [
{
"adversarial_probability": 0.15,
"nominal_probability": 0.3,
"probability_change": -0.15,
"scenario_index": 2
},
{
"adversarial_probability": 0.35,
"nominal_probability": 0.2,
"probability_change": 0.15,
"scenario_index": 0
}
],
"truncated_probability_shift_count": 0
},
"assumptions": [
"Every objective uses a governed portfolio-level unacceptable and aspiration anchor; clipping creates a transparent zero-to-one utility scale and makes saturation explicit rather than normalizing to whichever candidates happened to be submitted.",
"Admissible stakeholder preferences are exactly the bounded-simplex polytope, and the solver checks its vertices; objectives are additively compensatory inside that declared set unless a hard constraint or exclusion encodes a veto.",
"Total-variation ambiguity moves probability only among represented joint scenarios; dependencies and exclusions are complete, initiative objective contributions are additive, and omitted interactions or regimes can reverse the portfolio.",
"Supported tradeoffs are optima for at least one weight vertex, not the complete Pareto set; exact mode certifies only the submitted model, heuristic mode has no global optimality certificate, and neither result is a person-level ranking."
],
"configuration": {
"budget": 400000,
"initiative_count": 3,
"maximum_exact_states": 65536,
"minimum_robust_utility": 0.3,
"objective_count": 2,
"represented_state_count": 8,
"scenario_count": 3,
"solver_mode": "exact_enumeration",
"state_count_is_capped": false,
"total_variation_radius": 0.15,
"weight_vertex_count": 2
},
"decision": "robust_multiobjective_portfolio_optimized_exact",
"method": "bounded_preference_total_variation_multiobjective_portfolio_v1",
"objective_diagnostics": [ Truncated for display — the full payload is 106 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 Define each objective's direction, portfolio-level unacceptable and aspiration anchors, practical utility difference, and admissible weight interval; enumerate every vertex of the resulting bounded simplex.
- 2 For each dependency- and exclusion-feasible portfolio, aggregate aligned objective scenarios, map them onto anchored zero-to-one utilities, and adversarially reweight scenario probability inside a total-variation radius for every preference vertex.
- 3 Maximize the worst preference-and-probability utility, compare with the nominal central-weight optimum, and return weight-vertex-supported tradeoffs after practical-dominance filtering with exact or heuristic provenance.
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.
- Utility anchors and bounded weights are elicited before optimization, additive compensation is acceptable absent hard vetoes, contributions/dependencies/exclusions are complete, and joint scenarios plus ambiguity radius are validated out of time.
- The recommendation is optimal only for its stated objective, feasible set, evidence, and solver guarantee; it is not a universal management optimum.
- The supported set is not the complete Pareto frontier, probability robustness cannot cover omitted regimes, and no central or adversarial weighting is a universal value judgment or person-level ranking.
Minimum evidence
- objectives: at least 2 rows/items
- initiatives: at least 1 rows/items
- nominal_scenario_probabilities: at least 2 rows/items
- budget: required and organization-defined
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-objective joint scenario contribution tensor plus out-of-time nominal probability error used to calibrate total-variation radius
- objective direction and scope, unacceptable/aspiration anchors, practical differences, admissible preference weights, vetoes, additivity, budget, scenario probabilities, ambiguity radius, robust utility floor, and solver promotion
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": "solve a budgeted dependencysafe portfolio against" }
→ finds "solve_robust_multiobjective_portfolio"
gitrevio_capability_describe
{ "capability_id": "solve_robust_multiobjective_portfolio" }
→ returns the input schema and agent guidance shown on this page
gitrevio_capability_run
{ "capability_id": "solve_robust_multiobjective_portfolio", "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
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.
Forecast feature adoption revenue
Forecast feature adoption, revenue, and contribution with a grouped discrete-time hazard model trained on reconciled censored cohorts, required to beat a pooled-hazard baseline on later cohorts before posterior and capacity-constrained forecasts are decision-safe.
Allocate attention budget
Use exact knapsack optimization to allocate limited expert-review time by expected avoided loss.
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.
Calculate hidden work tax
Translate unplanned work, rework, incidents, and coordination into capacity and cost leakage.