Managing object values and resource consumption

A non-transitory computer-readable medium comprising instructions that are executable by a processing device for causing the processing device to:

• receive input data comprising (i) a plurality of constraints on a parameter associated with an object over a future timespan, and (ii) a minimum amount of the object to be provided to users during the future timespan;
• generate a data structure based on the plurality of constraints, the data structure comprising candidate values for the parameter that comply with the plurality of constraints assigned to a plurality of dates occurring during the future timespan;
• determine a plurality of actionable periods occurring within the future timespan, the plurality of actionable periods being time periods during which a value of the parameter is set to one of the candidate values in the data structure to comply with the plurality of constraints;
• generate aggregated actionable periods by combining together pairs of actionable periods from among the plurality of actionable periods that span adjacent date ranges in the future timespan;
• determine that a first combination of candidate values associated with the aggregated actionable periods results in the minimum amount of the object being provided to the users during the future timespan, the first combination of candidate values comprising a first subset of the candidate values having lowest magnitudes during the aggregated actionable periods;
• in response to determining that the first combination of candidate values results in the minimum amount of the object being provided to the users during the future timespan, determine a second combination of candidate values associated with the aggregated actionable periods, the second combination of candidate values being determined by applying a cutting-plane algorithm in which constraints are iteratively added to a relaxed problem to identify the second combination of candidate values, wherein the second combination of candidate values satisfies a return objective and comprises a second subset of the candidate values with higher magnitudes than the first combination of candidate values;
• and
• cause the second combination of candidate values to be transmitted to a remote computing device, wherein the second combination of values are usable by the remote computing device to implement a value schedule for the object.

A computer-implemented method comprising:

• receiving input data comprising (i) a plurality of constraints on a parameter associated with an object over a future timespan, and (ii) a minimum amount of the object to be provided to users during the future timespan;
• generating a data structure based on the plurality of constraints, the data structure comprising candidate values for the parameter that comply with the plurality of constraints assigned to a plurality of dates occurring during the future timespan;
• determining a plurality of actionable periods occurring within the future timespan, the plurality of actionable periods being time periods during which a value of the parameter is set to one of the candidate values in the data structure to comply with the plurality of constraints;
• generating aggregated actionable periods by combining together pairs of actionable periods from among the plurality of actionable periods that span adjacent date ranges in the future timespan;
• determining that a first combination of candidate values associated with the aggregated actionable periods results in the minimum amount of the object being provided to the users during the future timespan, the first combination of candidate values comprising a first subset of the candidate values having lowest magnitudes during the aggregated actionable periods;
• in response to determining that the first combination of candidate values results in the minimum amount of the object being provided to the users during the future timespan, determining a second combination of candidate values associated with the aggregated actionable periods, the second combination of candidate values being determined by applying a cutting-plane algorithm in which constraints are iteratively added to a relaxed problem to identify the second combination of candidate values, wherein the second combination of candidate values satisfies a return objective and comprises a second subset of the candidate values with higher magnitudes than the first combination of candidate values;
• and
• causing the second combination of candidate values to be transmitted to a remote computing device, wherein the second combination of values are usable by the remote computing device to implement a value schedule for the object.