rpsg_riskprog: Solves risk minimization problems with linear constraints on...

Description Usage Arguments Value Note Author(s) References See Also Examples

View source: R/rpsg_riskprog.R

Description

Finds a minimum for a problem specified by

min_x [risk + d \cdot x]

subject to

A \cdot x = b

Aeq \cdot x = beq

lb ≤q x ≤q ub

where
A, Aeq are matrices;
d, x are vectors;
b, beq, lb, ub are vectors or scalars;
risk(x) function is a linear combination of PSG risk functions, PSG deterministic functions, or PSG utility functions. List of PSG functions for riskprog

Usage

1
rpsg_riskprog(model, stroptions = NULL)

Arguments

model

list with data for optimization problem. Some components are optional. Names of list members:

model$risk

character with description of PSG function (objective include only one PSG function) or character vector with coefficients and PSG functions in one of the following form: coefficient 1, function 1, ... , coefficient K, function K. List of PSG functions for riskprog

model$w

parameter (numeric) of the PSG function (for one PSG function in objective) or vector of parameters (for linear combination of PSG functions; order of parameters are the same as the order of functions in model$risk, "na" denotes the absent parameter);

model$H

matrix for one PSG function in objective risk or vector of matrices for linear combination of PSG functions risk (order of matrix are the same as the order of functions in model$risk);

model$c

vector of benchmark for one PSG function in objective risk or vector of vectors of benchmarks for linear combination of PSG functions risk (order of vectors are the same as the order of functions in model$risk);

model$p

vector of probabilities for one PSG function in objective risk or vector of vectors of probabilities for linear combination of PSG functions risk (order of vectors are the same as the order of functions in model$risk);

model$d

vector for linear component of objective;

model$Aineq

matrix for linear inequality constraint;

model$bineq

vector or scalars for linear inequality constraint;

model$Aeq

matrix for linear equality constraint;

model$beq

vector for linear equality constraint;

model$lb

vector of lower bounds for x;

model$ub

vector of upper bounds for x;

model$x0

initial point for x.

stroptions

list with additional optimization options:

stroptions$solver

character with name of optimization solver: VAN (default), CAR, BULDOZER, TANK;

stroptions$precision

number of digits that solver tries to obtain in objective and constraints (default = 7);

stroptions$time.limit

time in seconds restricting the duration of the optimization process;

stroptions$linearization

number 0 or 1, controls internal representation of risk function, which can speed up the optimization process (used with CAR and TANK solvers);

stroptions$stages

number of stages of the optimization process. This parameter should be specified for VaR, Probability, and Cardinality groups of functions, default = 9;

stroptions$types

number that specifies the variables types of a problem. If Types is defined as column-vector, it should include as many components as number of variables Problem includes. The components of column-vector can possess the values 0 - for variables of type real, or 1- for variables of type boolean, or 2 - for variables of type integer. If Types is defined as one number (0, or 1, or 2) than all variables types real, or boolean, or integer respectively;

stroptions$mip

number that specifies the linearization of functions and using MIP capabilities of Gurobi. active only in VANGRB, CARGRB or HELI solvers (which are based on Gurobi optimization solvers and are available only if Gurobi is installed);

stroptions$save.to.text

character with path to the folder for storing problem in General (Text) Format of PSG.

Value

list results with solution results:

results$status

status of solved problem;

results$objective

optimal value of objective function;

results$gap

difference between objective value in obtained point and Lower estimate of optimal value;

results$optimal.point

optimal point;

results$ineq.constraint.value

optimal values of left hand sides of linear inequality constraint;

results$ineq.constraint.residual

residual of linear inequality constraint;

results$eq.constraint.value

optimal values of left hand sides of linear equality constraint;

results$eq.constraint.residual

residual of linear equality constraint;

results$function.value

optimal values of PSG functions defined in problem;

results$loading.time

data loading time;

results$preprocessing.time

preprocessing time;

results$solving.time

solving time.

Note

Author(s)

Stan Uryasev [aut, cre, cph], Grigoriy Zrazhevsky [aut], Viktor Kuzmenko [aut], Alex Zrazhevsky [aut]

Maintainer: Stan Uryasev <[email protected]>

References

American Optimal Decisions
Portfolio Safeguard Help

See Also

rpsg_riskconstrprog rpsg_riskratioprog

Examples

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#Problem of CVaR minimization:
#Find x = (x1,x2,x3,x4) minimizing
#risk(x) = CVaR(0.95,x)
#subject to
#x1+x2+x3+x4 = 1
#x1>=0, x2>=0, x3>=0, x4>=0

input.model <- list()
input.model$risk <- "cvar_risk"
input.model$w <- 0.95
input.model$H<-matrix(c(1,4,8,3, 7,5,4,6, 2,8,1,0,0,3,4,9),nrow=4, byrow=TRUE)
input.model$c <- c(0.2, 0.11, 0.6, 0.1)
input.model$Aeq <- matrix(c(1, 1, 1, 1),nrow=1)
input.model$beq <- 1
input.model$lb<-c(0, 0, 0, 0)

options<-list()
options$solver <- "van"
options$precision <- 7
options$stages <- 30

results <- rpsg_riskprog(input.model,options)

print(results)

PSGExpress documentation built on July 26, 2019, 5:02 p.m.