| add_absolute_targets | Add absolute targets |
| add_asym_connectivity_penalties | Add asymmetric connectivity penalties |
| add_binary_decisions | Add binary decisions |
| add_boundary_penalties | Add boundary penalties |
| add_cbc_solver | Add a _CBC_ solver |
| add_connectivity_penalties | Add connectivity penalties |
| add_contiguity_constraints | Add contiguity constraints |
| add_cplex_solver | Add a _CPLEX_ solver |
| add_cuts_portfolio | Add Bender's cuts portfolio |
| add_default_portfolio | Add a default portfolio |
| add_default_solver | Add default solver |
| add_extra_portfolio | Add an extra portfolio |
| add_feature_contiguity_constraints | Add feature contiguity constraints |
| add_feature_weights | Add feature weights |
| add_gap_portfolio | Add a gap portfolio |
| add_gurobi_solver | Add a _Gurobi_ solver |
| add_highs_solver | Add a _HiGHS_ solver |
| add_linear_constraints | Add linear constraints |
| add_linear_penalties | Add linear penalties |
| add_locked_in_constraints | Add locked in constraints |
| add_locked_out_constraints | Add locked out constraints |
| add_loglinear_targets | Add targets using log-linear scaling |
| add_lsymphony_solver | Add a _SYMPHONY_ solver with _lpsymphony_ |
| add_mandatory_allocation_constraints | Add mandatory allocation constraints |
| add_manual_bounded_constraints | Add manually specified bound constraints |
| add_manual_locked_constraints | Add manually specified locked constraints |
| add_manual_targets | Add manual targets |
| add_max_cover_objective | Add maximum coverage objective |
| add_max_features_objective | Add maximum feature representation objective |
| add_max_phylo_div_objective | Add maximum phylogenetic diversity objective |
| add_max_phylo_end_objective | Add maximum phylogenetic endemism objective |
| add_max_utility_objective | Add maximum utility objective |
| add_min_largest_shortfall_objective | Add minimum largest shortfall objective |
| add_min_penalties_objective | Add minimum penalties objective |
| add_min_set_objective | Add minimum set objective |
| add_min_shortfall_objective | Add minimum shortfall objective |
| add_neighbor_constraints | Add neighbor constraints |
| add_proportion_decisions | Add proportion decisions |
| add_relative_targets | Add relative targets |
| add_rsymphony_solver | Add a _SYMPHONY_ solver with _Rsymphony_ |
| add_semicontinuous_decisions | Add semi-continuous decisions |
| add_shuffle_portfolio | Add a shuffle portfolio |
| add_top_portfolio | Add a top portfolio |
| adjacency_matrix | Adjacency matrix |
| binary_stack | Binary stack |
| boundary_matrix | Boundary matrix |
| branch_matrix | Branch matrix |
| category_layer | Category layer |
| category_vector | Category vector |
| compile | Compile a problem |
| connectivity_matrix | Connectivity matrix |
| ConservationModifier-class | Conservation problem modifier class |
| ConservationProblem-class | Conservation problem class |
| Constraint-class | Constraint class |
| constraints | Conservation problem constraints |
| Decision-class | Decision class |
| decisions | Add decision types |
| eval_asym_connectivity_summary | Evaluate asymmetric connectivity of solution |
| eval_boundary_summary | Evaluate boundary length of solution |
| eval_connectivity_summary | Evaluate connectivity of solution |
| eval_cost_summary | Evaluate cost of solution |
| eval_feature_representation_summary | Evaluate feature representation by solution |
| eval_ferrier_importance | Evaluate solution importance using Ferrier scores |
| eval_n_summary | Evaluate number of planning units selected by solution |
| eval_rank_importance | Evaluate solution importance using incremental ranks |
| eval_rare_richness_importance | Evaluate solution importance using rarity weighted richness... |
| eval_replacement_importance | Evaluate solution importance using replacement cost scores |
| eval_target_coverage_summary | Evaluate target coverage by solution |
| fast_extract | Fast extract |
| feature_abundances | Feature abundances |
| feature_names | Feature names |
| importance | Evaluate solution importance |
| intersecting_units | Find intersecting units |
| knit_print | Print an object for knitr package. |
| loglinear_interpolation | Log-linear interpolation |
| marxan_boundary_data_to_matrix | Convert _Marxan_ boundary data to matrix format |
| marxan_connectivity_data_to_matrix | Convert _Marxan_ connectivity data to matrix format |
| marxan_problem | _Marxan_ conservation problem |
| new_waiver | Waiver |
| number_of_features | Number of features |
| number_of_planning_units | Number of planning units |
| number_of_total_units | Number of total units |
| number_of_zones | Number of zones |
| Objective-class | Objective class |
| objectives | Add an objective |
| optimization_problem | Optimization problem |
| OptimizationProblem-class | Optimization problem class |
| OptimizationProblem-methods | Optimization problem methods |
| penalties | Add a penalty |
| Penalty-class | Penalty class |
| Portfolio-class | Portfolio class |
| portfolios | Add portfolios |
| presolve_check | Presolve check |
| prioritizr | prioritizr: Systematic Conservation Prioritization in R |
| prioritizr-deprecated | Deprecation notice |
| problem | Conservation planning problem |
| proximity_matrix | Proximity matrix |
| reexports | Objects exported from other packages |
| rescale_matrix | Rescale a matrix |
| rij_matrix | Feature by planning unit matrix |
| run_calculations | Run calculations |
| show | Show |
| sim_data | Get simulated conservation planning data |
| simulate_cost | Simulate cost data |
| simulate_data | Simulate data |
| simulate_species | Simulate species habitat suitability data |
| solve | Solve |
| Solver-class | Solver class |
| solvers | Add solvers |
| summaries | Evaluate solutions using summary statistics |
| Target-class | Target class |
| targets | Add representation targets |
| tibble-methods | Manipulate tibbles |
| write_problem | Write problem |
| zone_names | Zone names |
| zones | Management zones |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.