OptimizationProblem-class: Optimization problem class

OptimizationProblem-classR Documentation

Optimization problem class

Description

The OptimizationProblem class is used to represent an optimization problem. Data are stored in memory and accessed using an external pointer. Only experts should interact with this class directly.

Fields

$ptr

externalptr object.

$data

list object.

Usage

x$print()

x$show()

x$repr()

x$ncol()

x$nrow()

x$ncell()

x$modelsense()

x$vtype()

x$obj()

x$pwlobj()

x$A()

x$rhs()

x$sense()

x$lb()

x$ub()

x$number_of_projects()

x$number_of_actions()

x$number_of_features()

x$number_of_branches()

x$row_ids()

x$col_ids()

x$get_data()

Arguments

ptr

externalptr object.

Details

print

print the object.

show

show the object.

repr

character representation of object.

ncol

integer number of columns (variables) in model matrix.

nrow

integer number of rows (constraints) in model matrix.

ncell

integer number of cells in model matrix.

modelsense

character model sense.

vtype

character vector of variable types.

obj

numeric vector containing the linear components of the objective function.

pwlobj

list object containing the piece-wise linear components of the objective function.

A

Matrix::dgCMatrix model matrix

rhs

numeric vector of right-hand-side constraints.

sense

character vector of constraint senses.

lb

numeric vector of lower bounds for each decision variable.

ub

numeric vector of upper bounds for each decision variable.

number_of_projects

integer number of projects in the problem.

number_of_actions

integer number of actions in the problem.

number_of_features

integer number of features in the problem.

number_of_branches

integer number of phylogenetic branches in the problem.

col_ids

character names describing each decision variable (column) in the model matrix.

row_ids

character names describing each constraint (row) in in the model matrix.

get_data

list containing additional data.


prioritizr/ppr documentation built on Sept. 10, 2022, 1:18 p.m.