One-shot interface to the SCIP solver. Formulates and solves:
$$\min_{x} \; obj' x$$
subject to constraint rows defined by A, b, sense,
with variable types vtype and bounds lb, ub.
scip_solve(obj, A, b, sense, vtype = "C", lb = 0, ub = Inf, control = list())A named list with components:
Character; solver status (e.g., "optimal", "infeasible", "unbounded").
Numeric; optimal objective value (or NA if no solution).
Numeric vector; primal solution (or NULL if no solution).
Integer; number of solutions found.
Numeric; relative optimality gap.
List with additional solver information (solve_time, iterations, nodes).
Numeric vector of length n; objective coefficients.
Constraint matrix (m x n). Can be a dense matrix,
dgCMatrix, or simple_triplet_matrix.
Numeric vector of length m; constraint right-hand side.
Character vector of length m; constraint sense.
Each element must be "<=", ">=", or "==".
Character; variable types. Either a single value applied to all
variables, or a vector of length n. Values: "C" (continuous),
"B" (binary), "I" (integer). Default "C".
Numeric; lower bounds for variables. Single value or vector of
length n. Default 0.
Numeric; upper bounds for variables. Single value or vector of
length n. Default Inf.
A list of solver parameters, typically from scip_control.