Skip to content

Redundancy Allocation Problem (RAP) optimisation #40

Description

@derrynknife

Given per-component cost/weight and reliability, choose integer redundancy per subsystem to maximise system reliability (or minimise cost for a reliability target) under a budget constraint.

This is the canonical RBD optimisation problem, and is distinct from the existing reliability-allocation methods (simple_allocation/equal_allocation/improvement_allocation), which distribute a target reliability down to components rather than choosing redundancy.

Estimate

Effort: M–L (up to ~1 week) · Value: Med

The formulation (DP / heuristic / MILP over system_probability) is well-trodden and integrates cleanly with the existing engine. A canonical, teachable problem with appeal to design engineers and students, but a narrower day-to-day audience than the condition-based or companion-model work. Solid fill-in item.

Metadata

Metadata

Assignees

No one assigned

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions