Namegmut-75-50
Submitted byNora Konnyu
Groupgmu
TermsNo licence of record
Imported from the MIPLIB2010 submissions. It predates MIPLIB's
submission form, and the licence that form required. See
LICENSE.
set_packingvariable_bound
Timber harvest scheduling model. Solved by ParaXpress in a 12288 core supercomputer run on HLRN III. These are harvest scheduling models of hypothetical forest planning problems where net timber revenues are maximized over a planning horizon subject to four sets of constraints: 1. Each management unit can be harvested only once over the planning horizon, 2. Volume harvested in one planning period should not be less or more than some portion of that in the preceding period, 3. Area-weighted average age of the forest by the end of the plan should notbe less than a certain target age. 4. Clearcut size in any planning period has to be below a specific limit. Decision variable are management units and generalized management units (group of management units with a combined area not exceeding the limit on clearcut size) and can be either fully harvested or left untouched in any planning period, therefore there is a binary restriction on the decision variables.
Source description quoted from MIPLIB 2017; links and
mathematical notation formatted for the web.
View on MIPLIB 2017 →