Title: | R Optimization Infrastructure |
---|---|
Description: | The R Optimization Infrastructure ('ROI') <doi:10.18637/jss.v094.i15> is a sophisticated framework for handling optimization problems in R. Additional information can be found on the 'ROI' homepage <http://roi.r-forge.r-project.org/>. |
Authors: | Kurt Hornik [aut], David Meyer [aut], Florian Schwendinger [aut], Stefan Theussl [aut, cre], Diethelm Wuertz [ctb] |
Maintainer: | Stefan Theussl <[email protected]> |
License: | GPL-3 |
Version: | 1.0-0 |
Built: | 2024-11-09 02:35:53 UTC |
Source: | https://github.com/r-forge/roi |
Canonicalize the linear term of a linear constraint.
Objects from the following classes can be canonicalized:
"NULL"
, "numeric"
, "matrix"
, "simple_triplet_matrix"
and "list"
.
as.L_term(x, ...)
as.L_term(x, ...)
x |
an R object. |
... |
further arguments passed to or from other methods. |
In the case of lists
"as.Q_term"
is applied to every element
of the list, for NULL
one can supply the optional arguments "nrow"
and "ncol"
which will create a "simple_triplet_zero_matrix"
with the specified dimension.
an object of class "simple_triplet_matrix"
Canonicalize the quadraric term of a quadratic constraint.
Objects from the following classes can be canonicalized:
"NULL"
, "numeric"
, "matrix"
, "simple_triplet_matrix"
and "list"
.
as.Q_term(x, ...) ## S3 method for class 'list' as.Q_term(x, ...) ## S3 method for class 'numeric' as.Q_term(x, ...) ## S3 method for class 'matrix' as.Q_term(x, ...) ## S3 method for class 'simple_triplet_matrix' as.Q_term(x, ...) ## S3 method for class ''NULL'' as.Q_term(x, ...)
as.Q_term(x, ...) ## S3 method for class 'list' as.Q_term(x, ...) ## S3 method for class 'numeric' as.Q_term(x, ...) ## S3 method for class 'matrix' as.Q_term(x, ...) ## S3 method for class 'simple_triplet_matrix' as.Q_term(x, ...) ## S3 method for class ''NULL'' as.Q_term(x, ...)
x |
an R object. |
... |
further arguments |
In the case of lists
"as.Q_term"
is applied to every element
of the list, for NULL
one can supply the optional arguments "nrow"
and "ncol"
which will create a "simple_triplet_zero_matrix"
with the specified dimension.
an object of class "simple_triplet_matrix"
ROI distinguishes between 2 different types of bounds:
No Bounds NO_bound
Variable Bounds V_bound
(inherits from "bound"
)
## S3 method for class 'bound' c(...) is.bound(x)
## S3 method for class 'bound' c(...) is.bound(x)
x |
object to be tested |
... |
arguments (inheriting from bound) to be combined |
ROI provides the method V_bound
as constructor for variable bounds.
NO_bound
is not explicitly implemented but represented by NULL
.
The bounds of a given optimization problem (OP)
can be accessed or mutated via the method 'bounds'
.
bounds(x) ## S3 method for class 'OP' bounds(x) bounds(x) <- value
bounds(x) ## S3 method for class 'OP' bounds(x) bounds(x) <- value
x |
an object of type |
value |
an object derived from |
the extracted bounds object on get and the altered 'OP'
object on set.
## Not run: lp_obj <- L_objective(c(1, 2)) lp_con <- L_constraint(c(1, 1), dir="==", rhs=2) lp_bound <- V_bound(ui=1:2, ub=c(3, 3)) lp <- OP(objective=lp_obj, constraints=lp_con, bounds=lp_bound, maximum=FALSE) bounds(lp) x <- ROI_solve(lp) x$objval x$solution bounds(lp) <- V_bound(ui=1:2, ub=c(1, 1)) y <- ROI_solve(lp) y$objval y$solution ## End(Not run)
## Not run: lp_obj <- L_objective(c(1, 2)) lp_con <- L_constraint(c(1, 1), dir="==", rhs=2) lp_bound <- V_bound(ui=1:2, ub=c(3, 3)) lp <- OP(objective=lp_obj, constraints=lp_con, bounds=lp_bound, maximum=FALSE) bounds(lp) x <- ROI_solve(lp) x$objval x$solution bounds(lp) <- V_bound(ui=1:2, ub=c(1, 1)) y <- ROI_solve(lp) y$objval y$solution ## End(Not run)
Conic constraints are often written in the form
where is a
(sparse) matrix and
are the slack variables restricted to
some cone
which is typically the product of simpler cones
. The right hand side
is a vector of length
.
C_constraint(L, cones, rhs, names = NULL) as.C_constraint(x, ...) is.C_constraint(x) ## S3 method for class 'C_constraint' length(x) ## S3 method for class 'C_constraint' variable.names(object, ...) ## S3 method for class 'C_constraint' terms(x, ...)
C_constraint(L, cones, rhs, names = NULL) as.C_constraint(x, ...) is.C_constraint(x) ## S3 method for class 'C_constraint' length(x) ## S3 method for class 'C_constraint' variable.names(object, ...) ## S3 method for class 'C_constraint' terms(x, ...)
L |
a numeric vector of length |
cones |
an object of class |
rhs |
a numeric vector giving the right hand side of the constraints. |
names |
an optional character vector giving the names of |
x |
an R object. |
... |
further arguments passed to or from other methods (currently ignored). |
object |
an R object. |
an object of class "C_constraint"
which inherits
from "constraint"
.
## minimize: x1 + x2 + x3 ## subject to: ## x1 == sqrt(2) ## ||(x2, x3)|| <= x1 x <- OP(objective = c(1, 1, 1), constraints = C_constraint(L = rbind(rbind(c(1, 0, 0)), diag(x=-1, 3)), cones = c(K_zero(1), K_soc(3)), rhs = c(sqrt(2), rep(0, 3))), types = rep("C", 3), bounds = V_bound(li = 1:3, lb = rep(-Inf, 3)), maximum = FALSE)
## minimize: x1 + x2 + x3 ## subject to: ## x1 == sqrt(2) ## ||(x2, x3)|| <= x1 x <- OP(objective = c(1, 1, 1), constraints = C_constraint(L = rbind(rbind(c(1, 0, 0)), diag(x=-1, 3)), cones = c(K_zero(1), K_soc(3)), rhs = c(sqrt(2), rep(0, 3))), types = rep("C", 3), bounds = V_bound(li = 1:3, lb = rep(-Inf, 3)), maximum = FALSE)
ROI distinguishes between 5 different types of constraint:
No Constraint NO_constraint
(inherits from "constraint"
)
Linear Constraint L_constraint
(inherits from "constraint"
)
Quadratic Constraint Q_constraint
(inherits from "constraint"
)
Conic Constraint C_constraint
(inherits from "constraint"
)
Function Constraint F_constraint
(inherits from "constraint"
)
## S3 method for class 'constraint' c(..., recursive = FALSE) as.constraint(x) is.constraint(x) ## S3 method for class 'constraint' dim(x)
## S3 method for class 'constraint' c(..., recursive = FALSE) as.constraint(x) is.constraint(x) ## S3 method for class 'constraint' dim(x)
recursive |
a logical, giving if the arguments should be combined recursively. |
x |
an object to be coerced or tested. |
... |
objects to be combined. |
"=="
, ">="
and "<="
SignsThe utility functions eq
, leq
and
geq
replicate the signs "=="
, ">="
and "<="
n
times.
eq(n) leq(n) geq(n)
eq(n) leq(n) geq(n)
n |
an integer giving the number of times the sign should be repeated. |
eq(3) leq(2) geq(4)
eq(3) leq(2) geq(4)
The constraints of a given optimization problem (OP)
can be accessed or mutated via the method 'constraints'
.
constraints(x) ## S3 method for class 'OP' constraints(x) constraints(x) <- value
constraints(x) ## S3 method for class 'OP' constraints(x) constraints(x) <- value
x |
an object used to select the method. |
value |
an R object. |
the extracted constraints object.
Stefan Theussl
## minimize: x + 2 y ## subject to: x + y >= 1 ## x, y >= 0 x <- OP(1:2) constraints(x) <- L_constraint(c(1, 1), ">=", 1) constraints(x)
## minimize: x + 2 y ## subject to: x + y >= 1 ## x, y >= 0 x <- OP(1:2) constraints(x) <- L_constraint(c(1, 1), ">=", 1) constraints(x)
The utility function equal
can be used to compare two
ROI objects and is mainly used for testing purposes.
equal(x, y, ...) ## S3 method for class ''NULL'' equal(x, y, ...) ## S3 method for class 'logical' equal(x, y, ...) ## S3 method for class 'integer' equal(x, y, ...) ## S3 method for class 'numeric' equal(x, y, ...) ## S3 method for class 'character' equal(x, y, ...) ## S3 method for class 'list' equal(x, y, ...) ## S3 method for class 'simple_triplet_matrix' equal(x, y, ...) ## S3 method for class 'L_constraint' equal(x, y, ...) ## S3 method for class 'Q_constraint' equal(x, y, ...) ## S3 method for class 'V_bound' equal(x, y, ...)
equal(x, y, ...) ## S3 method for class ''NULL'' equal(x, y, ...) ## S3 method for class 'logical' equal(x, y, ...) ## S3 method for class 'integer' equal(x, y, ...) ## S3 method for class 'numeric' equal(x, y, ...) ## S3 method for class 'character' equal(x, y, ...) ## S3 method for class 'list' equal(x, y, ...) ## S3 method for class 'simple_triplet_matrix' equal(x, y, ...) ## S3 method for class 'L_constraint' equal(x, y, ...) ## S3 method for class 'Q_constraint' equal(x, y, ...) ## S3 method for class 'V_bound' equal(x, y, ...)
x |
an R object to be compared with object y. |
y |
an R object to be compared with object x. |
... |
optional arguments to |
TRUE
if x
and y
are equal FALSE
otherwise.
## compare numeric values equal(1e-4, 1e-5, tol=1e-3) ## L_constraint lc1 <- L_constraint(diag(1), dir=c("=="), rhs=1) lc2 <- L_constraint(diag(2), dir=c("==", "<="), rhs=1:2) equal(lc1, lc1) equal(lc1, lc2)
## compare numeric values equal(1e-4, 1e-5, tol=1e-3) ## L_constraint lc1 <- L_constraint(diag(1), dir=c("=="), rhs=1) lc2 <- L_constraint(diag(2), dir=c("==", "<="), rhs=1:2) equal(lc1, lc1) equal(lc1, lc2)
Function (or generally speaking nonlinear) constraints are typically of the form
where is a
well-defined R function taking the objective variables
(typically a numeric vector) as arguments.
is called the
right hand side of the constraints.
F_constraint(F, dir, rhs, J = NULL, names = NULL) ## S3 method for class 'F_constraint' variable.names(object, ...) is.F_constraint(x) as.F_constraint(x, ...) ## S3 method for class ''NULL'' as.F_constraint(x, ...) ## S3 method for class 'NO_constraint' as.F_constraint(x, ...) ## S3 method for class 'constraint' as.F_constraint(x, ...) ## S3 method for class 'F_constraint' terms(x, ...)
F_constraint(F, dir, rhs, J = NULL, names = NULL) ## S3 method for class 'F_constraint' variable.names(object, ...) is.F_constraint(x) as.F_constraint(x, ...) ## S3 method for class ''NULL'' as.F_constraint(x, ...) ## S3 method for class 'NO_constraint' as.F_constraint(x, ...) ## S3 method for class 'constraint' as.F_constraint(x, ...) ## S3 method for class 'F_constraint' terms(x, ...)
F |
a |
dir |
a character vector with the directions of the
constraints. Each element must be one of |
rhs |
a numeric vector with the right hand side of the constraints. |
J |
an optional |
names |
an optional character vector giving the names of x. |
object |
an R object. |
x |
object to be tested. |
... |
further arguments passed to or from other methods (currently ignored). |
an object of class "F_constraint"
which inherits
from "constraint"
.
Stefan Theussl
General objective function to be optimized.
F_objective(F, n, G = NULL, H = NULL, names = NULL) ## S3 method for class 'F_objective' terms(x, ...) as.F_objective(x) ## S3 method for class 'F_objective' variable.names(object, ...)
F_objective(F, n, G = NULL, H = NULL, names = NULL) ## S3 method for class 'F_objective' terms(x, ...) as.F_objective(x) ## S3 method for class 'F_objective' variable.names(object, ...)
F |
an R |
n |
the number of objective variables. |
G |
an R |
H |
an optional |
names |
an optional character vector giving the names of x. |
x |
an R object. |
... |
further arguments passed to or from other methods |
object |
an R object. |
an object of class "F_objective"
which inherits
from "objective"
.
Stefan Theussl
Extract the gradient from its argument (typically a ROI
object of class "objective"
).
G(x, ...)
G(x, ...)
x |
an object used to select the method. |
... |
further arguments passed down to the
|
By default ROI uses the "grad"
function from the
numDeriv package to derive the gradient information.
An alternative function can be provided via "ROI_options"
.
For example ROI_options("gradient", myGrad)
would tell ROI to use the function "myGrad"
for the
gradient calculation. The only requirement to the function
"myGrad"
is that it has the argument "func"
which takes a function with a scalar real result.
a "function"
.
## Not run: f <- function(x) { return( 100 * (x[2] - x[1]^2)^2 + (1 - x[1])^2 ) } x <- OP( objective = F_objective(f, n=2L), bounds = V_bound(li=1:2, ui=1:2, lb=c(-3, -3), ub=c(3, 3)) ) G(objective(x))(c(0, 0)) ## gradient numerically approximated by numDeriv f.gradient <- function(x) { return( c( -400 * x[1] * (x[2] - x[1] * x[1]) - 2 * (1 - x[1]), 200 * (x[2] - x[1] * x[1])) ) } x <- OP( objective = F_objective(f, n=2L, G=f.gradient), bounds = V_bound(li=1:2, ui=1:2, lb=c(-3, -3), ub=c(3, 3)) ) G(objective(x))(c(0, 0)) ## gradient calculated by f.gradient ## End(Not run)
## Not run: f <- function(x) { return( 100 * (x[2] - x[1]^2)^2 + (1 - x[1])^2 ) } x <- OP( objective = F_objective(f, n=2L), bounds = V_bound(li=1:2, ui=1:2, lb=c(-3, -3), ub=c(3, 3)) ) G(objective(x))(c(0, 0)) ## gradient numerically approximated by numDeriv f.gradient <- function(x) { return( c( -400 * x[1] * (x[2] - x[1] * x[1]) - 2 * (1 - x[1]), 200 * (x[2] - x[1] * x[1])) ) } x <- OP( objective = F_objective(f, n=2L, G=f.gradient), bounds = V_bound(li=1:2, ui=1:2, lb=c(-3, -3), ub=c(3, 3)) ) G(objective(x))(c(0, 0)) ## gradient calculated by f.gradient ## End(Not run)
tests if the given object is an variable bound
which represents default values only
(i.e., all lower bounds are 0
and all upper bounds as Inf
).
is.default_bound(x)
is.default_bound(x)
x |
object to be tested |
a logical of length one indicating wether default bounds are given
Derive the Jacobian for a given constraint.
J(x, ...) ## S3 method for class 'L_constraint' J(x, ...) ## S3 method for class 'Q_constraint' J(x, ...)
J(x, ...) ## S3 method for class 'L_constraint' J(x, ...) ## S3 method for class 'Q_constraint' J(x, ...)
x |
a |
... |
further arguments |
a list of functions
L <- matrix(c(3, 4, 2, 2, 1, 2, 1, 3, 2), nrow=3, byrow=TRUE) lc <- L_constraint(L = L, dir = c("<=", "<=", "<="), rhs = c(60, 40, 80)) J(lc)
L <- matrix(c(3, 4, 2, 2, 1, 2, 1, 3, 2), nrow=3, byrow=TRUE) lc <- L_constraint(L = L, dir = c("<=", "<=", "<="), rhs = c(60, 40, 80)) J(lc)
Constructor functions for the different cone types. Currently ROI supports eight different types of cones.
Zero cone
Nonnegative (linear) cone
Second-order cone
Positive semidefinite cone
Exponential cone
Dual exponential cone
Power cone
Dual power cone
K_zero(size) K_lin(size) K_soc(sizes) K_psd(sizes) K_expp(size) K_expd(size) K_powp(alpha) K_powd(alpha)
K_zero(size) K_lin(size) K_soc(sizes) K_psd(sizes) K_expp(size) K_expd(size) K_powp(alpha) K_powd(alpha)
size |
a integer giving the size of the cone,
if the dimension of the cones is fixed
(i.e. |
sizes |
a integer giving the sizes of the cones,
if the dimension of the cones is not fixed
(i.e. |
alpha |
a numeric vector giving the |
K_zero(3) ## 3 equality constraints K_lin(3) ## 3 constraints where the slack variable s lies in the linear cone
K_zero(3) ## 3 equality constraints K_lin(3) ## 3 constraints where the slack variable s lies in the linear cone
Linear constraints are typically of the form
where is a
(sparse) matrix of coefficients
to the objective variables
and the right hand side
is a vector of length
.
L_constraint(L, dir, rhs, names = NULL) ## S3 method for class 'L_constraint' variable.names(object, ...) as.L_constraint(x, ...) is.L_constraint(x) ## S3 method for class 'L_constraint' length(x) ## S3 method for class 'L_constraint' terms(x, ...)
L_constraint(L, dir, rhs, names = NULL) ## S3 method for class 'L_constraint' variable.names(object, ...) as.L_constraint(x, ...) is.L_constraint(x) ## S3 method for class 'L_constraint' length(x) ## S3 method for class 'L_constraint' terms(x, ...)
L |
a numeric vector of length |
dir |
a character vector with the directions of the
constraints. Each element must be one of |
rhs |
a numeric vector with the right hand side of the constraints. |
names |
an optional character vector giving the names of |
object |
an R object. |
... |
further arguments passed to or from other methods (currently ignored). |
x |
an R object. |
an object of class "L_constraint"
which inherits
from "constraint"
.
Stefan Theussl
A linear objective function is typically of the form
where is a (sparse) vector of coefficients to the
objective variables
.
L_objective(L, names = NULL) ## S3 method for class 'L_objective' terms(x, ...) as.L_objective(x) ## S3 method for class 'L_objective' variable.names(object, ...)
L_objective(L, names = NULL) ## S3 method for class 'L_objective' terms(x, ...) as.L_objective(x) ## S3 method for class 'L_objective' variable.names(object, ...)
L |
a numeric vector of length |
names |
an optional character vector giving the names of |
x |
an R object. |
... |
further arguments passed to or from other methods |
object |
an R object. |
an object of class "L_objective"
which inherits
from "Q_objective"
and "objective"
.
Stefan Theussl
The maximum of a given optimization problem (OP)
can be accessed or mutated via the method 'maximum'
.
If 'maximum'
is set to TRUE
the OP is maximized,
if 'maximum'
is set to FALSE
the OP is minimized.
maximum(x) maximum(x) <- value
maximum(x) maximum(x) <- value
x |
an object used to select the method. |
value |
an R object. |
a logical giving the direction.
## maximize: x + y ## subject to: x + y <= 2 ## x, y >= 0 x <- OP(objective = c(1, 1), constraints = L_constraint(L = c(1, 1), dir = "<=", rhs = 2), maximum = FALSE) maximum(x) <- TRUE maximum(x)
## maximize: x + y ## subject to: x + y <= 2 ## x, y >= 0 x <- OP(objective = c(1, 1), constraints = L_constraint(L = c(1, 1), dir = "<=", rhs = 2), maximum = FALSE) maximum(x) <- TRUE maximum(x)
This function was contributed by Diethelm Wuertz.
nlminb2( start, objective, eqFun = NULL, leqFun = NULL, lower = -Inf, upper = Inf, gradient = NULL, hessian = NULL, control = list() )
nlminb2( start, objective, eqFun = NULL, leqFun = NULL, lower = -Inf, upper = Inf, gradient = NULL, hessian = NULL, control = list() )
start |
numeric vector of start values. |
objective |
the function to be minimized |
eqFun |
functions specifying equal constraints of the form
|
leqFun |
functions specifying less equal constraints of the
form |
lower |
a numeric representing lower variable
bounds. Repeated as needed. Default: |
upper |
a numeric representing upper variable
bounds. Repeated as needed. Default: |
gradient |
gradient of |
hessian |
hessian of |
control |
a list of control parameters. See
|
list()
Diethelm Wuertz
## Equal constraint function eval_g0_eq <- function( x, params = c(1,1,-1)) { return( params[1]*x^2 + params[2]*x + params[3] ) } eval_f0 <- function( x, ... ) { return( 1 ) }
## Equal constraint function eval_g0_eq <- function( x, params = c(1,1,-1)) { return( params[1]*x^2 + params[2]*x + params[3] ) } eval_f0 <- function( x, ... ) { return( 1 ) }
"NO_constraint"
In case the constraints
slot in the problem object is
NULL
the return value of a call of constraints()
will return an object of class "NO_constraint"
which
inherits from "L_constraint"
.
NO_constraint(n_obj) as.NO_constraint(x, ...) is.NO_constraint(x)
NO_constraint(n_obj) as.NO_constraint(x, ...) is.NO_constraint(x)
n_obj |
a numeric vector of length |
x |
an R object. |
... |
further arguments passed to or from other methods (currently ignored). |
an object of class "NO_constraint"
which inherits
from "L_constraint"
and "constraint"
.
Stefan Theussl
The objective of a given optimization problem (OP)
can be accessed or mutated via the method 'objective'
.
objective(x) objective(x) <- value as.objective(x)
objective(x) objective(x) <- value as.objective(x)
x |
an object used to select the method. |
value |
an R object. |
a function inheriting from "objective"
.
Stefan Theussl
x <- OP() objective(x) <- 1:3
x <- OP() objective(x) <- 1:3
Optimization problem constructor
OP(objective, constraints, types, bounds, maximum = FALSE) as.OP(x)
OP(objective, constraints, types, bounds, maximum = FALSE) as.OP(x)
objective |
an object inheriting from class |
constraints |
an object inheriting from class |
types |
a character vector giving the types of the objective
variables, with |
bounds |
|
maximum |
a logical giving the direction of the
optimization. |
x |
an R object. |
an object of class "OP"
.
Stefan Theussl
Theussl S, Schwendinger F, Hornik K (2020). 'ROI: An Extensible R Optimization Infrastructure.' Journal of Statistical Software_, *94*(15), 1-64. doi: 10.18637/jss.v094.i15 (URL: https://doi.org/10.18637/jss.v094.i15).
## Simple linear program. ## maximize: 2 x_1 + 4 x_2 + 3 x_3 ## subject to: 3 x_1 + 4 x_2 + 2 x_3 <= 60 ## 2 x_1 + x_2 + x_3 <= 40 ## x_1 + 3 x_2 + 2 x_3 <= 80 ## x_1, x_2, x_3 are non-negative real numbers LP <- OP( c(2, 4, 3), L_constraint(L = matrix(c(3, 2, 1, 4, 1, 3, 2, 2, 2), nrow = 3), dir = c("<=", "<=", "<="), rhs = c(60, 40, 80)), max = TRUE ) LP ## Simple quadratic program. ## minimize: - 5 x_2 + 1/2 (x_1^2 + x_2^2 + x_3^2) ## subject to: -4 x_1 - 3 x_2 >= -8 ## 2 x_1 + x_2 >= 2 ## - 2 x_2 + x_3 >= 0 QP <- OP( Q_objective (Q = diag(1, 3), L = c(0, -5, 0)), L_constraint(L = matrix(c(-4,-3,0,2,1,0,0,-2,1), ncol = 3, byrow = TRUE), dir = rep(">=", 3), rhs = c(-8,2,0)) ) QP
## Simple linear program. ## maximize: 2 x_1 + 4 x_2 + 3 x_3 ## subject to: 3 x_1 + 4 x_2 + 2 x_3 <= 60 ## 2 x_1 + x_2 + x_3 <= 40 ## x_1 + 3 x_2 + 2 x_3 <= 80 ## x_1, x_2, x_3 are non-negative real numbers LP <- OP( c(2, 4, 3), L_constraint(L = matrix(c(3, 2, 1, 4, 1, 3, 2, 2, 2), nrow = 3), dir = c("<=", "<=", "<="), rhs = c(60, 40, 80)), max = TRUE ) LP ## Simple quadratic program. ## minimize: - 5 x_2 + 1/2 (x_1^2 + x_2^2 + x_3^2) ## subject to: -4 x_1 - 3 x_2 >= -8 ## 2 x_1 + x_2 >= 2 ## - 2 x_2 + x_3 >= 0 QP <- OP( Q_objective (Q = diag(1, 3), L = c(0, -5, 0)), L_constraint(L = matrix(c(-4,-3,0,2,1,0,0,-2,1), ncol = 3, byrow = TRUE), dir = rep(">=", 3), rhs = c(-8,2,0)) ) QP
Takes an object of class "OP"
(optimization problem)
and returns the signature of the optimization problem.
OP_signature(x)
OP_signature(x)
x |
an object of class |
A data.frame
giving the signature of the
the optimization problem.
Quadratic constraints are typically of the form
where is the
th of
(sparse) matrices
(all of dimension
) giving the coefficients of the quadratic
part of the equation. The
(sparse) matrix
holds the coefficients of the linear part of the equation and
refers to the
th row. The right hand side of the constraints
is represented by the vector
.
Q_constraint(Q, L, dir, rhs, names = NULL) ## S3 method for class 'Q_constraint' variable.names(object, ...) as.Q_constraint(x) is.Q_constraint(x) ## S3 method for class 'Q_constraint' length(x) ## S3 method for class 'Q_constraint' terms(x, ...)
Q_constraint(Q, L, dir, rhs, names = NULL) ## S3 method for class 'Q_constraint' variable.names(object, ...) as.Q_constraint(x) is.Q_constraint(x) ## S3 method for class 'Q_constraint' length(x) ## S3 method for class 'Q_constraint' terms(x, ...)
Q |
a list of (sparse) matrices representing the quadratic part of each constraint. |
L |
a numeric vector of length |
dir |
a character vector with the directions of the
constraints. Each element must be one of |
rhs |
a numeric vector with the right hand side of the constraints. |
names |
an optional character vector giving the names of |
object |
an R object. |
... |
further arguments passed to or from other methods (currently ignored). |
x |
an R object. |
an object of class "Q_constraint"
which inherits
from "constraint"
.
Stefan Theussl
A quadratic objective function is typically of the form
where is a (sparse) matrix
defining the quadratic part of the function and
is a
(sparse) vector of coefficients to the
defining the linear
part.
Q_objective(Q, L = NULL, names = NULL) ## S3 method for class 'Q_objective' terms(x, ...) as.Q_objective(x) ## S3 method for class 'Q_objective' variable.names(object, ...)
Q_objective(Q, L = NULL, names = NULL) ## S3 method for class 'Q_objective' terms(x, ...) as.Q_objective(x) ## S3 method for class 'Q_objective' variable.names(object, ...)
Q |
a |
L |
a numeric vector of length |
names |
an optional character vector giving the names of |
x |
an R object. |
... |
further arguments passed to or from other methods |
object |
an R object. |
an object of class "Q_objective"
which inherits
from "objective"
.
Stefan Theussl
Take a sequence of constraints (ROI objects) arguments and combine by rows, i.e., putting several constraints together.
## S3 method for class 'constraint' rbind(..., use.names = FALSE, recursive = FALSE)
## S3 method for class 'constraint' rbind(..., use.names = FALSE, recursive = FALSE)
... |
constraints objects to be concatenated. |
use.names |
a logical if |
recursive |
a logical, if TRUE, rbind . |
The output type is determined from the highest type of the
components in the hierarchy "L_constraint"
<
"Q_constraint"
< "F_constraint"
and "L_constraint"
< "C_constraint"
.
an object of a class depending on the input which also
inherits from "constraint"
. See Details.
Stefan Theussl
ROI_applicable_solvers
takes as argument an
optimization problem (object of class 'OP'
) and returns a vector
giving the applicable solver. The set of applicable solver is restricted
on the available solvers, which means if solver "A"
and "B"
would be applicable but a ROI.plugin
is only installed for solver
"A"
only solver "A"
would be listed as applicable solver.
ROI_applicable_solvers(op)
ROI_applicable_solvers(op)
op |
an ROI-object of type |
An character vector giving the applicable solver, for a certain optimization problem.
ROI_available_solvers returns a data.frame of details corresponding to solvers currently available at one or more repositories. The current list of packages is downloaded over the Internet.
ROI_available_solvers(x = NULL, method = getOption("download.file.method"))
ROI_available_solvers(x = NULL, method = getOption("download.file.method"))
x |
an object used to select a method. It can be either
an object of class |
method |
a character string giving the method to be used for downloading files.
For more information see |
To get an overview about the available solvers
ROI_available_solvers()
can be used.
If a signature or an object of class "OP"
is provided ROI will only return the solvers
applicable the optimization problem. Note since NLP solver
are also applicable for LP and QP they will also be listed.
a data.frame with one row per package and repository.
## Not run: ROI_available_solvers() op <- OP(1:2) ROI_available_solvers(op) ROI_available_solvers(OP_signature(op)) ## End(Not run)
## Not run: ROI_available_solvers() op <- OP(1:2) ROI_available_solvers(op) ROI_available_solvers(OP_signature(op)) ## End(Not run)
Allow the user to set and examine a variety of ROI options like the default solver or the function used to compute the gradients.
ROI_options(option, value)
ROI_options(option, value)
option |
any options can be defined, using 'key, value' pairs. If 'value' is missing the current set value is returned for the given 'option'. If both are missing. all set options are returned. |
value |
the corresponding value to set for the given option. |
Add a status code to the status database.
ROI_plugin_add_status_code_to_db(solver, code, symbol, message, roi_code = 1L)
ROI_plugin_add_status_code_to_db(solver, code, symbol, message, roi_code = 1L)
solver |
a character string giving the name of the solver. |
code |
an integer giving the status code of the solver. |
symbol |
a character string giving the status symbol. |
message |
a character string used as status message. |
roi_code |
an integer giving the ROI status code, 1L for failure and 0L for success. |
Other plugin functions:
ROI_plugin_build_equality_constraints()
,
ROI_plugin_build_inequality_constraints()
,
ROI_plugin_canonicalize_solution()
,
ROI_plugin_get_solver_name()
,
ROI_plugin_make_signature()
,
ROI_plugin_register_solver_control()
,
ROI_plugin_register_solver_method()
,
ROI_plugin_solution_prim()
,
ROI_registered_solver_control()
## Not run: solver <- "ecos" ROI_plugin_add_status_code_to_db(solver, 0L, "ECOS_OPTIMAL", "Optimal solution found.", 0L) ROI_plugin_add_status_code_to_db(solver, -7L, "ECOS_FATAL", "Unknown problem in solver.", 1L) solver <- "glpk" ROI_plugin_add_status_code_to_db(solver, 5L, "GLP_OPT", "Solution is optimal.", 0L) ROI_plugin_add_status_code_to_db(solver, 1L, "GLP_UNDEF", "Solution is undefined.", 1L) ## End(Not run)
## Not run: solver <- "ecos" ROI_plugin_add_status_code_to_db(solver, 0L, "ECOS_OPTIMAL", "Optimal solution found.", 0L) ROI_plugin_add_status_code_to_db(solver, -7L, "ECOS_FATAL", "Unknown problem in solver.", 1L) solver <- "glpk" ROI_plugin_add_status_code_to_db(solver, 5L, "GLP_OPT", "Solution is optimal.", 0L) ROI_plugin_add_status_code_to_db(solver, 1L, "GLP_UNDEF", "Solution is undefined.", 1L) ## End(Not run)
There exist different forms of functional equality constraints, this function transforms the form used in ROI into the forms commonly used by R optimization solvers.
ROI_plugin_build_equality_constraints(x, type = c("eq_zero", "eq_rhs"))
ROI_plugin_build_equality_constraints(x, type = c("eq_zero", "eq_rhs"))
x |
an object of type |
type |
an character giving the type of the function to be returned,
possible values are |
There are two types of equality constraints commonly used in R
eq\_zero
: and
eq\_rhs
: .
Returns one function, which combines all the functional constraints.
This function only intended for plugin authors.
Other plugin functions:
ROI_plugin_add_status_code_to_db()
,
ROI_plugin_build_inequality_constraints()
,
ROI_plugin_canonicalize_solution()
,
ROI_plugin_get_solver_name()
,
ROI_plugin_make_signature()
,
ROI_plugin_register_solver_control()
,
ROI_plugin_register_solver_method()
,
ROI_plugin_solution_prim()
,
ROI_registered_solver_control()
There exist different forms of functional inequality constraints, this function transforms the form used in ROI into the forms commonly used by R optimization solvers.
ROI_plugin_build_inequality_constraints(x, type = c("leq_zero", "geq_zero"))
ROI_plugin_build_inequality_constraints(x, type = c("leq_zero", "geq_zero"))
x |
an object of type |
type |
an character giving the type of the function to be returned,
possible values are |
There are three types of inequality constraints commonly used in R
leq\_zero
: and
geq\_zero
: and
leq_geq\_rhs
: .
Returns one function, which combines all the functional constraints.
This function only intended for plugin authors.
Other plugin functions:
ROI_plugin_add_status_code_to_db()
,
ROI_plugin_build_equality_constraints()
,
ROI_plugin_canonicalize_solution()
,
ROI_plugin_get_solver_name()
,
ROI_plugin_make_signature()
,
ROI_plugin_register_solver_control()
,
ROI_plugin_register_solver_method()
,
ROI_plugin_solution_prim()
,
ROI_registered_solver_control()
Transform the solution to a standardized form.
ROI_plugin_canonicalize_solution( solution, optimum, status, solver, message = NULL, ... )
ROI_plugin_canonicalize_solution( solution, optimum, status, solver, message = NULL, ... )
solution |
a numeric or integer vector giving the solution of the optimization problem. |
optimum |
a numeric giving the optimal value. |
status |
an integer giving the status code (exit flag). |
solver |
a character string giving the name of the solver. |
message |
an optional R object giving the original solver message. |
... |
further arguments to be stored in the solution object. |
an object of class "OP_solution"
.
Other plugin functions:
ROI_plugin_add_status_code_to_db()
,
ROI_plugin_build_equality_constraints()
,
ROI_plugin_build_inequality_constraints()
,
ROI_plugin_get_solver_name()
,
ROI_plugin_make_signature()
,
ROI_plugin_register_solver_control()
,
ROI_plugin_register_solver_method()
,
ROI_plugin_solution_prim()
,
ROI_registered_solver_control()
Get the name of the solver plugin.
ROI_plugin_get_solver_name(pkgname)
ROI_plugin_get_solver_name(pkgname)
pkgname |
a string giving the package name. |
Returns the name of the solver as character.
Other plugin functions:
ROI_plugin_add_status_code_to_db()
,
ROI_plugin_build_equality_constraints()
,
ROI_plugin_build_inequality_constraints()
,
ROI_plugin_canonicalize_solution()
,
ROI_plugin_make_signature()
,
ROI_plugin_register_solver_control()
,
ROI_plugin_register_solver_method()
,
ROI_plugin_solution_prim()
,
ROI_registered_solver_control()
Create a solver signature, the solver signatures are used to indicate which problem types can be solved by a given solver.
ROI_plugin_make_signature(...)
ROI_plugin_make_signature(...)
... |
signature definitions |
an object of class "ROI_signature"
(inheriting from data.frame) with the supported signatures.
Other plugin functions:
ROI_plugin_add_status_code_to_db()
,
ROI_plugin_build_equality_constraints()
,
ROI_plugin_build_inequality_constraints()
,
ROI_plugin_canonicalize_solution()
,
ROI_plugin_get_solver_name()
,
ROI_plugin_register_solver_control()
,
ROI_plugin_register_solver_method()
,
ROI_plugin_solution_prim()
,
ROI_registered_solver_control()
## ROI_make_LP_signatures lp_signature <- ROI_plugin_make_signature( objective = "L", constraints = "L", types = c("C"), bounds = c("X", "V"), cones = c("X"), maximum = c(TRUE, FALSE) )
## ROI_make_LP_signatures lp_signature <- ROI_plugin_make_signature( objective = "L", constraints = "L", types = c("C"), bounds = c("X", "V"), cones = c("X"), maximum = c(TRUE, FALSE) )
Register a new reader / writer method to be used with
read.io
/ write.io
.
ROI_plugin_register_reader(type, solver, method) ROI_plugin_register_writer(type, solver, signature, method)
ROI_plugin_register_reader(type, solver, method) ROI_plugin_register_writer(type, solver, signature, method)
type |
a character giving the type of the file
(e.g. |
solver |
a character giving the name of the plugin (e.g. |
method |
a function registered as reader / writer method. |
signature |
a data.frame giving the signature of the optimization problems which can be read or written by the registered method. |
File Types
Method
NULL on success
Other input output:
ROI_read()
,
ROI_registered_reader()
,
ROI_registered_writer()
,
ROI_write()
Register a new reformulation method to be used with
ROI_reformulate
.
ROI_plugin_register_reformulation( from, to, method_name, method, description = "", cite = "", author = "" )
ROI_plugin_register_reformulation( from, to, method_name, method, description = "", cite = "", author = "" )
from |
a data.frame with the supported signatures. |
to |
a data.frame with the supported signatures. |
method_name |
a character string giving the name of the method. |
method |
a function registered as solver method. |
description |
a optional character string giving a description of what the reformulation does. |
cite |
a optional character string indicating a reference, such as the name of a book. |
author |
a optional character string giving the name of the author. |
TRUE on success
Other reformulate functions:
ROI_reformulate()
,
ROI_registered_reformulations()
Register a new solver control argument.
ROI_plugin_register_solver_control(solver, args, roi_control = "X")
ROI_plugin_register_solver_control(solver, args, roi_control = "X")
solver |
a character string giving the solver name. |
args |
a character vector specifying with the supported signatures. |
roi_control |
a character vector specifying the corresponding ROI control argument. |
TRUE on success
Other plugin functions:
ROI_plugin_add_status_code_to_db()
,
ROI_plugin_build_equality_constraints()
,
ROI_plugin_build_inequality_constraints()
,
ROI_plugin_canonicalize_solution()
,
ROI_plugin_get_solver_name()
,
ROI_plugin_make_signature()
,
ROI_plugin_register_solver_method()
,
ROI_plugin_solution_prim()
,
ROI_registered_solver_control()
Register a new solver method.
ROI_plugin_register_solver_method(signatures, solver, method, plugin = solver)
ROI_plugin_register_solver_method(signatures, solver, method, plugin = solver)
signatures |
a data.frame with the supported signatures. |
solver |
a character string giving the solver name. |
method |
a function registered as solver method. |
plugin |
a character string giving the plgug-in name. |
TRUE on success
Other plugin functions:
ROI_plugin_add_status_code_to_db()
,
ROI_plugin_build_equality_constraints()
,
ROI_plugin_build_inequality_constraints()
,
ROI_plugin_canonicalize_solution()
,
ROI_plugin_get_solver_name()
,
ROI_plugin_make_signature()
,
ROI_plugin_register_solver_control()
,
ROI_plugin_solution_prim()
,
ROI_registered_solver_control()
Generic getter functions used by the function
solution
. These functions can be used to write
a solver specific getter function.
ROI_plugin_solution_prim(x, force = FALSE) ## S3 method for class 'OP_solution' ROI_plugin_solution_prim(x, force = FALSE) ## S3 method for class 'OP_solution_set' ROI_plugin_solution_prim(x, force = FALSE) ROI_plugin_solution_dual(x) ROI_plugin_solution_aux(x) ROI_plugin_solution_psd(x) ROI_plugin_solution_msg(x) ROI_plugin_solution_status_code(x) ROI_plugin_solution_status(x) ROI_plugin_solution_objval(x, force = FALSE)
ROI_plugin_solution_prim(x, force = FALSE) ## S3 method for class 'OP_solution' ROI_plugin_solution_prim(x, force = FALSE) ## S3 method for class 'OP_solution_set' ROI_plugin_solution_prim(x, force = FALSE) ROI_plugin_solution_dual(x) ROI_plugin_solution_aux(x) ROI_plugin_solution_psd(x) ROI_plugin_solution_msg(x) ROI_plugin_solution_status_code(x) ROI_plugin_solution_status(x) ROI_plugin_solution_objval(x, force = FALSE)
x |
an |
force |
a logical to control the return value in the case that the
status code is equal to 1 (i.e. something went wrong).
By default force is |
the corresponding solution/s.
Other plugin functions:
ROI_plugin_add_status_code_to_db()
,
ROI_plugin_build_equality_constraints()
,
ROI_plugin_build_inequality_constraints()
,
ROI_plugin_canonicalize_solution()
,
ROI_plugin_get_solver_name()
,
ROI_plugin_make_signature()
,
ROI_plugin_register_solver_control()
,
ROI_plugin_register_solver_method()
,
ROI_registered_solver_control()
Reads an optimization problem from various file formats and
returns an optimization problem of class "OP"
.
ROI_read(file, type, solver = NULL, ...)
ROI_read(file, type, solver = NULL, ...)
file |
a character giving the name of the file the optimization problem is to be read from. |
type |
a character giving the type of the file
(e.g. |
solver |
an optional character giving the name of the plugin
(e.g. |
... |
further arguments passed on to the read method. |
x an optimization problem of class "OP"
.
Other input output:
ROI_plugin_register_reader_writer
,
ROI_registered_reader()
,
ROI_registered_writer()
,
ROI_write()
Register a new reformulation method.
ROI_reformulate(x, to, method = NULL)
ROI_reformulate(x, to, method = NULL)
x |
an object of class |
to |
a |
method |
a character string giving the name of the method. |
Currently ROI provides two reformulation methods.
bqp_to_lp
transforms binary quadratic problems to
linear mixed integer problems.
qp_to_socp
transforms quadratic problems with linear
constraints to second-order cone problems.
the reformulated optimization problem.
Other reformulate functions:
ROI_plugin_register_reformulation()
,
ROI_registered_reformulations()
## Example from ## Boros, Endre, and Peter L. Hammer. "Pseudo-boolean optimization." ## Discrete applied mathematics 123, no. 1 (2002): 155-225. ## minimize: 3 x y + y z - x - 4 y - z + 6 Q <- rbind(c(0, 3, 0), c(3, 0, 1), c(0, 1, 0)) L <- c(-1, -4, -1) x <- OP(objective = Q_objective(Q = Q, L = L), types = rep("B", 3)) ## reformulate into a mixed integer linear problem milp <- ROI_reformulate(x, "lp") ## reformulate into a second-order cone problem socp <- ROI_reformulate(x, "socp")
## Example from ## Boros, Endre, and Peter L. Hammer. "Pseudo-boolean optimization." ## Discrete applied mathematics 123, no. 1 (2002): 155-225. ## minimize: 3 x y + y z - x - 4 y - z + 6 Q <- rbind(c(0, 3, 0), c(3, 0, 1), c(0, 1, 0)) L <- c(-1, -4, -1) x <- OP(objective = Q_objective(Q = Q, L = L), types = rep("B", 3)) ## reformulate into a mixed integer linear problem milp <- ROI_reformulate(x, "lp") ## reformulate into a second-order cone problem socp <- ROI_reformulate(x, "socp")
Retrieve meta information about the registered reader
ROI_registered_reader(type = NULL)
ROI_registered_reader(type = NULL)
type |
an optional character giving the type of the file
(e.g. |
x a data.frame containing information about the registered readers.
Other input output:
ROI_plugin_register_reader_writer
,
ROI_read()
,
ROI_registered_writer()
,
ROI_write()
ROI_registered_reader() ROI_registered_reader("mps_fixed")
ROI_registered_reader() ROI_registered_reader("mps_fixed")
Retrieve meta information about the registered reformulations.
ROI_registered_reformulations()
ROI_registered_reformulations()
a data.frame giving some information about the registered reformulation methods.
Other reformulate functions:
ROI_plugin_register_reformulation()
,
ROI_reformulate()
ROI_registered_reformulations()
ROI_registered_reformulations()
Retrieve the registered solver control arguments.
ROI_registered_solver_control(solver)
ROI_registered_solver_control(solver)
solver |
a character string giving the solver name. |
a data.frame
giving the control arguments.
Other plugin functions:
ROI_plugin_add_status_code_to_db()
,
ROI_plugin_build_equality_constraints()
,
ROI_plugin_build_inequality_constraints()
,
ROI_plugin_canonicalize_solution()
,
ROI_plugin_get_solver_name()
,
ROI_plugin_make_signature()
,
ROI_plugin_register_solver_control()
,
ROI_plugin_register_solver_method()
,
ROI_plugin_solution_prim()
Retrieve the names of installed or registered solvers.
ROI_registered_solvers(...) ROI_installed_solvers(...)
ROI_registered_solvers(...) ROI_installed_solvers(...)
... |
arguments passed on to |
Whereas ROI_installed_solvers()
may lists the names of installed
solvers that do not necessarily work,
ROI_registered_solvers()
lists all solvers that can be used
to solve optimization problems.
a named character vector.
Stefan Theussl
Write an optimization problem to file.
ROI_registered_writer(signature = NULL)
ROI_registered_writer(signature = NULL)
signature |
an optimization problem of class |
Other input output:
ROI_plugin_register_reader_writer
,
ROI_read()
,
ROI_registered_reader()
,
ROI_write()
ROI_registered_writer() op <- OP(1:2) ROI_registered_writer(OP_signature(op))
ROI_registered_writer() op <- OP(1:2) ROI_registered_writer(OP_signature(op))
Solve a given optimization problem. This function uses the given solver (or searches for an appropriate solver) to solve the supplied optimization problem.
ROI_solve(x, solver, control = list(), ...)
ROI_solve(x, solver, control = list(), ...)
x |
an optimization problem of class |
solver |
a character vector specifying the solver to use. If
missing, then the default solver returned by
|
control |
a list with additional control parameters for the solver. This is solver specific so please consult the corresponding documentation. |
... |
a list of control parameters (overruling those
specified in |
a list containing the solution and a message from the solver.
solutionthe vector of optimal coefficients
objvalthe value of the objective function at the optimum
statusa list giving the status code and message form the solver. The status code is 0 on success (no error occurred) 1 otherwise.
messagea list giving the original message provided by the solver.
Stefan Theussl
Theussl S, Schwendinger F, Hornik K (2020). 'ROI: An Extensible R Optimization Infrastructure.' Journal of Statistical Software_, *94*(15), 1-64. doi: 10.18637/jss.v094.i15 (URL: https://doi.org/10.18637/jss.v094.i15).
## Rosenbrock Banana Function ## ----------------------------------------- ## objective f <- function(x) { return( 100 * (x[2] - x[1] * x[1])^2 + (1 - x[1])^2 ) } ## gradient g <- function(x) { return( c( -400 * x[1] * (x[2] - x[1] * x[1]) - 2 * (1 - x[1]), 200 * (x[2] - x[1] * x[1])) ) } ## bounds b <- V_bound(li = 1:2, ui = 1:2, lb = c(-3, -3), ub = c(3, 3)) op <- OP( objective = F_objective(f, n = 2L, G = g), bounds = b ) res <- ROI_solve( op, solver = "nlminb", control = list(start = c( -1.2, 1 )) ) solution( res ) ## Portfolio optimization - minimum variance ## ----------------------------------------- ## get monthly returns of 30 US stocks data( US30 ) r <- na.omit( US30 ) ## objective function to minimize obj <- Q_objective( 2*cov(r) ) ## full investment constraint full_invest <- L_constraint( rep(1, ncol(US30)), "==", 1 ) ## create optimization problem / long-only op <- OP( objective = obj, constraints = full_invest ) ## solve the problem - only works if a QP solver is registered ## Not run: res <- ROI_solve( op ) res sol <- solution( res ) names( sol ) <- colnames( US30 ) round( sol[ which(sol > 1/10^6) ], 3 ) ## End(Not run)
## Rosenbrock Banana Function ## ----------------------------------------- ## objective f <- function(x) { return( 100 * (x[2] - x[1] * x[1])^2 + (1 - x[1])^2 ) } ## gradient g <- function(x) { return( c( -400 * x[1] * (x[2] - x[1] * x[1]) - 2 * (1 - x[1]), 200 * (x[2] - x[1] * x[1])) ) } ## bounds b <- V_bound(li = 1:2, ui = 1:2, lb = c(-3, -3), ub = c(3, 3)) op <- OP( objective = F_objective(f, n = 2L, G = g), bounds = b ) res <- ROI_solve( op, solver = "nlminb", control = list(start = c( -1.2, 1 )) ) solution( res ) ## Portfolio optimization - minimum variance ## ----------------------------------------- ## get monthly returns of 30 US stocks data( US30 ) r <- na.omit( US30 ) ## objective function to minimize obj <- Q_objective( 2*cov(r) ) ## full investment constraint full_invest <- L_constraint( rep(1, ncol(US30)), "==", 1 ) ## create optimization problem / long-only op <- OP( objective = obj, constraints = full_invest ) ## solve the problem - only works if a QP solver is registered ## Not run: res <- ROI_solve( op ) res sol <- solution( res ) names( sol ) <- colnames( US30 ) round( sol[ which(sol > 1/10^6) ], 3 ) ## End(Not run)
Obtain the signature of a registered solver.
ROI_solver_signature(solver)
ROI_solver_signature(solver)
solver |
a character string giving the name of the solver. |
the solver signature if the specified solver is registered NULL
otherwise.
ROI_solver_signature("nlminb")
ROI_solver_signature("nlminb")
Write an optimization problem to file.
ROI_write(x, file, type, solver = NULL, ...)
ROI_write(x, file, type, solver = NULL, ...)
x |
an optimization problem of class |
file |
a character giving the name of the file the optimization problem is to be written. |
type |
a character giving the type of the file
(e.g. |
solver |
an optional character giving the name of the plugin
(e.g. |
... |
further arguments passed on to the write method. |
Other input output:
ROI_plugin_register_reader_writer
,
ROI_read()
,
ROI_registered_reader()
,
ROI_registered_writer()
The solution can be accessed via the method 'solution'
.
solution( x, type = c("primal", "dual", "aux", "psd", "msg", "objval", "status", "status_code"), force = FALSE, ... )
solution( x, type = c("primal", "dual", "aux", "psd", "msg", "objval", "status", "status_code"), force = FALSE, ... )
x |
an object of type |
type |
a character giving the name of the solution to be extracted. |
force |
a logical to control the return value in the case that the
status code is equal to 1 (i.e. something went wrong).
By default force is |
... |
further arguments passed to or from other methods. |
the extracted solution.
The types of a given optimization problem (OP)
can be accessed or mutated via the method 'types'
.
types(x) types(x) <- value
types(x) types(x) <- value
x |
an object used to select the method. |
value |
an R object. |
a character vector.
Stefan Theussl
## minimize: x + 2 y ## subject to: x + y >= 1 ## x, y >= 0 x, y are integer x <- OP(objective = 1:2, constraints = L_constraint(c(1, 1), ">=", 1)) types(x) <- c("I", "I") types(x)
## minimize: x + 2 y ## subject to: x + y >= 1 ## x, y >= 0 x, y are integer x <- OP(objective = 1:2, constraints = L_constraint(c(1, 1), ">=", 1)) types(x) <- c("I", "I") types(x)
This dataset contains the historical monthly returns of 30 of the largest US stocks from 1999-01-29 to 2013-12-31. This data is dividend adjusted based on the CRSP methodology.
A matrix with 30 columns (representing stocks) and 180 rows (months).
The selected stocks reflect the DJ 30 Industrial Average Index members as of 2013-09-20.
The data source is Quandl. Data flagged as "WIKI" in their database is public domain.
Constructs a variable bounds object.
V_bound(li, ui, lb, ub, nobj, ld = 0, ud = Inf, names = NULL) as.V_bound(x) is.V_bound(x)
V_bound(li, ui, lb, ub, nobj, ld = 0, ud = Inf, names = NULL) as.V_bound(x) is.V_bound(x)
li |
an integer vector specifying the indices of non-standard (i.e., values != 0) lower bounds. |
ui |
an integer vector specifying the indices of non-standard (i.e., values != Inf) upper bounds. |
lb |
a numeric vector with lower bounds. |
ub |
a numeric vector with upper bounds. |
nobj |
an integer representing the number of objective variables |
ld |
a numeric giving lower default bound. |
ud |
a numeric giving upper default bound. |
names |
a character vector giving the names of the bounds. |
x |
object to be coerced or tested. |
This function returns a sparse representation of objective variable bounds.
An S3 object of class "V_bound"
containing lower and
upper bounds of the objective variables.
V_bound(li=1:3, lb=rep.int(-Inf, 3)) V_bound(li=c(1, 5, 10), ui=13, lb=rep.int(-Inf, 3), ub=100, nobj=20)
V_bound(li=1:3, lb=rep.int(-Inf, 3)) V_bound(li=c(1, 5, 10), ui=13, lb=rep.int(-Inf, 3), ub=100, nobj=20)
The utility function vech
performs a
half-vectorization on the given matrices.
vech(...)
vech(...)
... |
one or more matrices to be half-vectorized. |
a matrix