oximo-solver
Solver trait, result types, status codes, and shared option building blocks for oximo.
This crate defines the contract that backend crates implement. End users interact with concrete backends (Highs, Gurobi, Gams) exposed by the umbrella oximo crate, they do not depend on this crate directly unless they are writing a new backend.
Usage
[]
= "0.4"
= "0.4"
Solver trait
Each backend defines its own Options type. Users get compile-time validation and LSP autocomplete on the options that actually apply to that backend.
SolverResult
termination records why the solve stopped, while primal_status records whether a usable
point came back.
| Field | Type | Description |
|---|---|---|
termination |
TerminationStatus |
Why the solve stopped |
primal_status |
PrimalStatus |
Whether a usable primal point is available |
solutions |
Vec<SolutionPoint> |
Primal points, best first (empty if no solution) |
dual |
FxHashMap<ConstraintId, f64> |
Constraint duals at the best point |
reduced_costs |
FxHashMap<VarId, f64> |
Variable reduced costs at the best point |
best_bound |
Option<f64> |
Dual/relaxation bound (branch-and-bound backends) |
gap |
Option<f64> |
Relative optimality gap, when reported |
solve_time |
Duration |
Wall time around the solve call |
iterations |
u64 |
Simplex iteration count (if reported) |
raw_log |
Option<String> |
Solver stdout/stderr |
Each SolutionPoint holds the primal variable values (FxHashMap<VarId, f64>) and that point's objective (Option<f64>). Index 0 is the best/incumbent. Backends with solution pools return the extra points after it.
Accessors
result.objective // Option<f64>, best solution's objective
result.value_of // Option<f64>, primal value for a Var expr (best solution)
result.value // Option<f64>, primal value by VarId (best solution)
result.dual_of // Option<f64>, dual for a constraint
result.best // Option<&SolutionPoint>, same as .solution(0)
result.solution // Option<&SolutionPoint>, i-th pooled point
result.result_count // usize, number of returned points
result.has_solution // true when a usable primal point is available
result.report // Display: model-aware summary (status, vars, duals)
// Indexed variables
result.value_of_idx // Option<f64>, value at a specific index
result.values_of // Iterator<(&IndexKey, f64)>, all entries with a primal value
result.values_of.filter // nonzero only (sparse solutions)
TerminationStatus
Why the solve stopped (complementary to whether a point was returned).
| Variant | Meaning |
|---|---|
Optimal |
Proven globally optimal |
LocallyOptimal |
A local optimum |
Infeasible |
No feasible solution exists |
Unbounded |
Objective is unbounded |
InfeasibleOrUnbounded |
Infeasible or unbounded; solver could not tell which |
IterationLimit |
Stopped at an iteration limit |
TimeLimit |
Stopped at a time limit |
NodeLimit |
Stopped at a branch-and-bound node limit |
Interrupted |
Stopped early (user limit/interrupt, sub-optimal stop) |
NumericError |
Solver reported numerical difficulties |
NotSolved |
Default, solve not yet called |
Other(String) |
Backend-specific status not covered above |
PrimalStatus
| Variant | Meaning |
|---|---|
NoSolution |
No primal point is available |
FeasiblePoint |
A feasible point is available, not proven optimal |
OptimalPoint |
A proven-optimal point is available |
SolverError
| Variant | Cause |
|---|---|
UnsupportedKind(ModelKind) |
Backend does not support this model kind |
NoObjective |
Model has no objective set |
Nonlinear |
Backend cannot handle nonlinear expressions |
Backend(String) |
Backend-reported error (e.g. license failure, bad option) |
Core(Error) |
Error from oximo-core |
Universal options
All backend options structs embed UniversalOptions and implement HasUniversal, which enables the UniversalOptionsExt blanket impl:
use UniversalOptionsExt;
use Duration;
let opts = default
.time_limit
.threads
.verbose;
| Method | Field | Type |
|---|---|---|
.time_limit(Duration) |
time_limit |
Option<Duration> |
.threads(u32) |
threads |
Option<u32> |
.verbose(bool) |
verbose |
Option<bool> |
Implementing HasUniversal for a new backend
use ;
Writing a new backend
Mirror the layout of an existing backend crate (oximo-highs, oximo-gurobi, oximo-gams):
lib.rs: public struct +impl Solver.supports()declares whichModelKinds are handled.solve()delegates totranslate::solve.options.rs: convertsMyOptionsinto the backend's native option calls.translate.rs:Model-> backend conversion and result extraction.
Add an optional dep + feature in oximo/Cargo.toml and re-export the type under oximo::solvers.
License
MIT OR Apache-2.0