A Decomposition Method Based On The Augmented Lagrangian

The impact of the introduction of sustainable forest management objectives on the optimisation of PC-based forest-level harvest schedules

“…Including adjacency constraints adds substantially to model size, complexity and solution times (Hoganson and Borges, 1998). To overcome these difficulties, specialised measures are often required such as random search techniques (Barrett et al, 1998), simulated annealing (Murray and Clinch, 1995), tabu search (Bettinger et al, 1997), lagrangian relaxation (Gunn et al, 1988) and upper bounding techniques (Lappi, 1992). However, owing to the dispersed nature of Coillte properties and forests, the adjacency issue is not considered a major problem for harvest scheduling.…”