Stochastic optimization models in forest planning: a progressive hedging solution approach
From MaRDI portal
Publication:748577
DOI10.1007/s10479-014-1608-4zbMath1323.90046OpenAlexW2136324214MaRDI QIDQ748577
David L. Woodruff, Roger J.-B. Wets, Jean-Paul Watson, Fernando Badilla Veliz, Andrés P. Weintraub
Publication date: 29 October 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1608-4
Stochastic programming (90C15) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Related Items (17)
New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty ⋮ The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems ⋮ Fifty years of operational research in forestry ⋮ Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems ⋮ Comparing an expected value with a multistage stochastic optimization approach for the case of wine grape harvesting operations with quality degradation ⋮ Supporting platelet inventory management decisions: what is the effect of extending platelets' shelf life? ⋮ Stochastic forestry planning under market and growth uncertainty ⋮ Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems ⋮ A study of progressive hedging for stochastic integer programming ⋮ Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs ⋮ Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming ⋮ Risk management for forestry planning under uncertainty in demand and prices ⋮ Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system ⋮ Brief history of systems analysis in forest resources ⋮ Operations research challenges in forestry: 33 open problems ⋮ A parallelized variable fixing process for solving multistage stochastic programs with progressive hedging ⋮ Building a stochastic programming model from scratch: a harvesting management example
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
- Forestry management under uncertainty
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
- Forest management challenges for operational researchers
- Dual decomposition in stochastic integer programming
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- Model tightening for integrated timber harvest and transportation planning
- Heuristic solution approaches to operational forest planning problems
- PySP: modeling and solving stochastic programs in Python
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
- A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation
- A Cutting Plane Approach for Chance Constrained Linear Programs
- A Heuristic System to Solve Mixed Integér Forest Planning Models
- Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
This page was built for publication: Stochastic optimization models in forest planning: a progressive hedging solution approach
