Conservation modeling engine framework

A system, comprising:

• a hardware processor;
• a computer readable memory in communication with the hardware processor;
• and
• a computer-readable hardware storage device in communication with the hardware processor;
• wherein the hardware processor executes program instructions stored on the computer-readable hardware storage device via the computer readable memory and thereby:
• creates a plurality of different conservation plans for a region for a future time period as a function of a determined rate of change of availability of a resource identified for conservation, wherein the plurality of conservation plans includes a first plan that has a least implementation cost relative to implementation costs of a second plan and a third plan of the plurality of conservation plans, the second plan that has a fastest time for implementation relative to times for implementation of the first plan and the third plan, and the third plan that conserves a most amount of the resource identified for conservation relative to amounts of the resource identified for conservation that are conserved by the first plan and the second plan;
• optimizes the first, second and third plans via one of a greedy algorithm, a penalty method algorithm and a cooperative optimization;
• predicts via a Monte Carlo methodology future values of an input variable at an execution time of the first, second and third plans;
• and
• modifies the optimized first, second and third plans to meet a threshold as a function of the predicted future value of the input variable.

An article of manufacture, comprising:

• a computer readable storage hardware device having computer readable program code embodied therewith, the computer readable program code comprising instructions for execution by a computer system processor that cause the processor to:
• create a plurality of different conservation plans for a region for a future time period as a function of a determined rate of change of availability of a resource identified for conservation, wherein the plurality of conservation plans includes a first plan that has a least implementation cost relative to implementation costs of a second plan and a third plan of the plurality of conservation plans, the second plan that has a fastest time for implementation relative to times for implementation of the first plan and the third plan, and the third plan that conserves a most amount of the resource identified for conservation relative to amounts of the resource identified for conservation that are conserved by the first plan and the second plan;
• optimize the first, second and third plans via one of a greedy algorithm, a penalty method algorithm and a cooperative optimization;
• predict via a Monte Carlo methodology future values of an input variable at an execution time of the first, second and third plans;
• and
• modify the optimized first, second and third plans to meet a threshold as a function of the predicted future value of the input variable.