SummarySummary of the package |
|
---|---|
prioritizr: Systematic Conservation Prioritization in R |
|
DataSimulated datasets distributed with the package |
|
|
Simulated conservation planning data |
Create and solve problemsFunctions for creating new problems and solving them |
|
Conservation planning problem |
|
Marxan conservation problem |
|
|
Solve |
ObjectivesFunctions for adding an objective to a problem |
|
Add an objective |
|
Add maximum coverage objective |
|
Add maximum feature representation objective |
|
Add maximum phylogenetic diversity objective |
|
Add maximum phylogenetic endemism objective |
|
Add maximum utility objective |
|
Add minimum set objective |
|
Add minimum shortfall objective |
|
TargetsFunctions for adding targets to a problem |
|
Add representation targets |
|
Add absolute targets |
|
Add targets using log-linear scaling |
|
Add manual targets |
|
Add relative targets |
|
ConstraintsFunctions for adding constraints to a problem |
|
Conservation problem constraints |
|
|
Add contiguity constraints |
|
Add feature contiguity constraints |
Add locked in constraints |
|
Add locked out constraints |
|
Add mandatory allocation constraints |
|
Add manually specified bounds constraints |
|
Add manually specified locked constraints |
|
|
Add neighbor constraints |
PenaltiesFunctions for adding penalties to a problem |
|
Add a penalty |
|
Add boundary penalties |
|
|
Add connectivity penalties |
|
Add linear penalties |
|
Add feature weights |
DecisionsFunctions for specifying the type of decisions in a problem |
|
Add decision types |
|
Add binary decisions |
|
Add default decisions |
|
Add proportion decisions |
|
Add semi-continuous decisions |
|
SolversFunctions for specifying how a problem should be solved |
|
Problem solvers |
|
Add a CPLEX solver |
|
Default solver |
|
Add a Gurobi solver |
|
Add a SYMPHONY solver with lpsymphony |
|
Add a SYMPHONY solver with Rsymphony |
|
PortfoliosFunctions for generating a portfolio of solutions |
|
Solution portfolios |
|
Add Bender's cuts portfolio |
|
Add an extra portfolio |
|
Add a gap portfolio |
|
Add a shuffle portfolio |
|
Add a top portfolio |
|
Summary statisticsFunctions for summarizing the performance of solutions |
|
Evaluate solutions using summary statistics |
|
Evaluate solution boundary length |
|
|
Evaluate solution connectivity |
Evaluate solution cost |
|
Evaluate feature representation |
|
Evaluate number of planning units selected. |
|
Evaluate target coverage |
|
ImportanceFunctions for calculating importance scores for a solution |
|
Evaluate solution importance |
|
Evaluate solution importance using Ferrier scores |
|
Evaluate solution importance using rarity weighted richness scores |
|
Evaluate solution importance using replacement cost scores |
|
Data simulationFunctions for simulating new datasets |
|
Simulate cost data |
|
Simulate data |
|
Simulate species habitat suitability data |
|
GeoprocessingFunctions for manipulating spatial datasets |
|
Fast extract |
|
Find intersecting units |
|
Processing multi-zone dataFunctions for manipulating data that pertain to multiple zones |
|
Category layer |
|
Category vector |
|
Binary stack |
|
Matrix functionsFunctions for creating matrices that are used in conservation planning problems for use in planning problems |
|
Adjacency matrix |
|
Boundary matrix |
|
Branch matrix |
|
Connectivity matrix |
|
Convert Marxan boundary data to a matrix format |
|
Proximity matrix |
|
Feature by planning unit matrix |
|
Problem manipulation functionsFunctions for extracting information from problems |
|
Number of features |
|
Number of planning units |
|
Number of total units |
|
Number of zones |
|
Feature names |
|
Feature abundances |
|
Zone names |
|
Miscellaneous functionsAssorted functions distributed with the package |
|
|
|
|
Show |
Pipe operator |
|
Tee operator |
|
Is it? |
|
Coerce object to another object |
|
Compile a problem |
|
Presolve check |
|
Log-linear interpolation |
|
Run calculations |
|
Distribute load |
|
Class definitions and methodsThese pages document the package’s internal data structures and functions for manipulating them—they contain information that is really only useful when adding new functionality to the package |
|
Identifier |
|
Waiver |
|
Create a new |
|
Optimization problem |
|
Predefined optimization problem |
|
Convert |
|
Array parameter prototype |
|
Collection prototype |
|
Conservation problem modifier prototype |
|
Conservation problem class |
|
Constraint prototype |
|
Decision prototype |
|
Miscellaneous parameter prototype |
|
Objective prototype |
|
Optimization problem class |
|
Parameter class |
|
Parameters class |
|
Penalty prototype |
|
Portfolio prototype |
|
Scalar parameter prototype |
|
Solver prototype |
|
Target prototype |
|
Management zones |
|
|
Optimization problem methods |
Manipulate tibbles |
|
Parameter definitionsThese pages document the package’s internal data structures for representing different types of variables—they contain information that is really only useful when adding new functionality to the package |
|
|
Array parameters |
Matrix parameters |
|
Miscellaneous parameter |
|
|
Scalar parameters |
Parameters |
|
Deprecated functions |
|
|
Deprecation notice |