Predicting Terminal Time And Final Crop Number For A Forest Plantation Stand: Pontryagin's Maximum Principle

• Autor: 0. Chikumbo ; Mareels, I M Y
• Assuntos: Dynamic programming ; Forest management ; Forests ; Formulations ; Optimization ; Plantations ; Pontryagin principle ; Search algorithms
• É parte de: WIT Transactions on Ecology and the Environment, 2003-01, Vol.64
• Notas: SourceType-Other Sources-1
  ObjectType-Article-1
  content type line 63
  ObjectType-Feature-2
  
• Descrição: A lot of work has gone into developing management strategies for forest plantation stands. Analysts have resorted to the use of dynamic programming to find an optimum management strategy for a stand. The sterile 'curse of dimensionality' in dynamic programming computations has lead to the pursuit of alternative heuristic search algorithms that are plagued with the inherent inability to verify optimality. Optimality in stand management has always been a lingering issue in forest literature, since stand optimisation formulations started appearing in forest science journals from the early 1960s. Pontryagin's Maximu
  
• Editor: Southampton: W I T Press
  
• Idioma: Inglês