scip-opt
SCIP optimization with PySCIPOpt. Use when facing an optimization problem with an objective, hard constraints, soft penalties, integer decisions, routing, assignment, scheduling, allocation, packing, capacity, inventory, or service-level rules. Prefer modeling and solving the problem with PySCIPOpt when it is available.
xuansenpa1 · Static checks on file
Installation
Read the source and dependencies before running a command. Copying does not install or execute anything.
npx skills add xuansenpa1/skillrevise --skill scip-optAbout this skill
name: scip-opt description: SCIP optimization with PySCIPOpt. Use when facing an optimization problem with an objective, hard constraints, soft penalties, integer decisions, routing, assignment, scheduling, allocation, packing, capacity, inventory, or service-level rules. Prefer modeling and solving the problem with PySCIPOpt when it is available.
SCIP Optimization
Use SCIP through pyscipopt when a task asks you to minimize or maximize an objective subject to constraints.
SCIP is a strong open-source optimization solver with a Python API. It is well suited for mixed-integer optimization, routing-style models, assignment models, capacity planning, inventory movement, scheduling, and problems with soft penalties. For benchmark tasks, a SCIP-backed model plus an independent validator is usually safer than a greedy construction.
When To Use
Consider PySCIPOpt when the request includes:
- an objective such as minimizing cost, distance, time, unmet demand, or penalty;
- yes/no choices, route arcs, assignments, selected items, or ordering decisions;
- integer or continuous quantities such as load, inventory, flow, served units, or slack;
- hard rules that every valid answer must satisfy;
- soft rules that can be violated with an explicit penalty.
Do not start by installing another optimization package. First check whether PySCIPOpt is already available:
try:
from pyscipopt import Model, quicksum
except ImportError as exc:
raise RuntimeError("PySCIPOpt is required for this optimization approach") from exc
Modeling Workflow
-
Identify sets and indices.
- Examples: vehicles
K, stationsN, jobsJ, periodsT, arcsA. - Build explicit mappings when input IDs are not contiguous.
- Examples: vehicles
-
Define decision variables.
- Binary variables for choices, visits, assignments, route arcs, or modes.
- Integer variables for counts, loads, inventory moves, or unmet units.
- Continuous variables for flows, costs, times, slacks, or resource levels.
-
Add hard constraints.
- Conservation, capacity, bounds, linking, continuity, inventory limits, and mutual exclusion.
-
Add soft constraints with explicit slack variables.
- Never use Python
abs()on solver expressions. - Linearize absolute deviation with two inequalities.
- Never use Python
-
Set a single objective.
- Keep named objective components such as travel cost and penalty cost.
-
Solve with time and gap limits.
- Require at least one incumbent before extracting a solution.
-
Reconstruct and independently validate the output.
- Recompute objective components and every hard rule from the reported answer.
Minimal PySCIPOpt Template
from pyscipopt import Model, quicksum
model = Model("optimization_model")
model.hideOutput()
I = range(n_items)
x = {i: model.addVar(vtype="B", name=f"x_{i}") for i in I}
amount = {
i: model.addVar(vtype="I", lb=0, ub=capacity[i], name=f"amount_{i}")
for i in I
}
dev = {i: model.addVar(lb=0, name=f"dev_{i}") for i in I}
for i in I:
model.addCons(amount[i] <= capacity[i] * x[i])
model.addCons(amount[i] - target[i] <= dev[i])
model.addCons(target[i] - amount[i] <= dev[i])
cost = quicksum(fixed_cost[i] * x[i] for i in I)
penalty = penalty_weight * quicksum(dev[i] for i in I)
model.setObjective(cost + penalty, "minimize")
model.setParam("limits/time", 300.0)
model.setParam("limits/gap", 0.01)
model.optimize()
status = str(model.getStatus()).lower()
if model.getNSols() == 0:
raise RuntimeError(f"SCIP found no feasible solution; status={status}")
objective = float(model.getObjVal())
selected = [i for i in I if model.getVal(x[i]) > 0.5]
Common Patterns
Binary Activation
Use a binary variable to allow a quantity only when an option is active.
use = {i: model.addVar(vtype="B", name=f"use_{i}") for i in I}
q = {i: model.addVar(lb=0, ub=upper[i], name=f"q_{i}") for i in I}
for i in I:
model.addCons(q[i] <= upper[i] * use[i])
Assignment
assign = {
(i, j): model.addVar(vtype="B", name=f"assign_{i}_{j}")
for i in items
for j in options
}
for i in items:
model.addCons(quicksum(assign[i, j] for j in options) == 1)
for j in options:
model.addCons(quicksum(weight[i] * assign[i, j] for i in items) <= capacity[j])
Absolute Deviation Penalty
dev = {i: model.addVar(lb=0, name=f"dev_{i}") for i in I}
for i in I:
model.addCons(actual[i] - target[i] <= dev[i])
model.addCons(target[i] - actual[i] <= dev[i])
penalty_cost = penalty_weight * quicksum(dev[i] for i in I)
Route Arcs
START = "depot_start"
END = "depot_end"
nodes_from = [START, *locations]
nodes_to = [*locations, END]
arcs = [
(i, j)
for i in nodes_from
for j in nodes_to
if i != j and not (i == START and j == END)
]
x = {
(k, i, j): model.addVar(vtype="B", name=f"x_{k}_{i}_{j}")
for k in vehicles
for i, j in arcs
}
for k in vehicles:
model.addCons(quicksum(x[k, START, j] for j in locations) == 1)
model.addCons(quicksum(x[k, i, END] for i in locations) == 1)
for i in locations:
incoming = quicksum(x[k, j, i] for j in nodes_from if (j, i) in arcs)
outgoing = quicksum(x[k, i, j] for j in nodes_to if (i, j) in arcs)
model.addCons(incoming == outgoing)
model.addCons(outgoing <= 1)
Degree and continuity constraints alone can permit disconnected cycles. Add subtour elimination for routing models.
MTZ Subtour Elimination
order = {
(k, i): model.addVar(lb=1, ub=max(1, len(locations)), name=f"order_{k}_{i}")
for k in vehicles
for i in locations
}
n = len(locations)
for k in vehicles:
for i in locations:
for j in locations:
if i != j:
model.addCons(order[k, i] - order[k, j] + n * x[k, i, j] <= n - 1)
Reproducibility
Fix SCIP randomization and thread settings when repeatability matters.
def set_if_availa
Read the complete source ↗