Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2024-03-05T17:27:48Z
dc.date.available 2024-03-05T17:27:48Z
dc.date.issued 2024-03-05
dc.identifier.uri https://sedici.unlp.edu.ar/handle/10915/163465
dc.description.abstract A Jupityer Notebook has been developed for teaching purposes to present an implementation of the well-known Model I for forest harvest planning in Guroby Python. Since the 1960s, forest management has formulated and solved this planning problem as a linear programming problem, the most widely studied and employed mathematical optimization technique. To show the implementation, the example problem from a classic forest management text is used and summarily reviewed, mainly to establish the context and introduce the mathematical notation. The concrete implementation has been coded on a Jupyter Notebook that was stored on the server provided by Google Colab to run Python code. An installation of the Gurobipy library that provides a license for the use of the powerful Gurobi solver was also used to find the optimal solution to the problem. en
dc.language en es
dc.subject Timber management es
dc.subject Forest-level management planning es
dc.subject Cutting schedule es
dc.subject Management regimes es
dc.subject Optimization es
dc.title Forest harvest scheduling with Model I linear programming formulation: a Gurobi Python implementation en
dc.type Objeto de aprendizaje es
sedici.identifier.uri https://colab.research.google.com/drive/1c65g5Vf_08TafrP-aMc41cG2OKRkcR53?usp=sharing es
sedici.creator.person Yapura, Pablo Fernando es
sedici.subject.materias Ciencias Agrarias es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Ciencias Agrarias y Forestales es
sedici.subtype Objeto de aprendizaje es
sedici.rights.license Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-sa/4.0/
dc.audience grado y posgrado es


This item appears in the following Collection(s)

Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) Except where otherwise noted, this item's license is described as Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)