A system includes determination of a total target value associated with N dimension members, determination of a set of historical values for each of the N dimension members, for each of the N dimension members, determination of a prediction interval based on the set of historical values of the dimension member, determination of an N-polytope in N-dimensional space based on the N determined prediction intervals, determination of an (N−1)-polytope of the N-dimensional space in which the sum of the N values of each coordinate of the (N−1)-polytope equals the total desired value, determination of an (N−1)-dimensional intersection of the N-polytope and the (N−1) polytope, and determination of a disaggregation of the total target value among the N dimension members based on the coordinates of the (N−1)-dimensional intersection.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method implemented by a computing system in response to execution of program code by a processor of the computing system, the method comprising: determining a total target value associated with N dimension members; determining a set of historical values for each of the N dimension member; for each of the N dimension members, determining a prediction interval based on the set of historical values of the dimension members; determining an N-polytope in N-dimensional space based on the N determined prediction intervals; determining an (N−1)-polytope of the N-dimensional space in which the sum of the N values of each coordinate of the (N−1)-polytope equals the total desired value; determining an (N−1)-dimensional intersection of the N-polytope and the (N−1) polytope; and determining a disaggregation of the total target value among the N dimension members based on the coordinates of the (N−1)-dimensional intersection. 2. A method according to claim 1, wherein determining the disaggregation of the total target value comprises: determining a center of mass of the (N−1)-dimensional intersection. 3. A method according to claim 2, wherein determining the center of mass of the (N−1)-dimensional intersection comprises: determining intersections between the (N−1)-dimensional intersection and edges of the N-polytope. 4. A method according to claim 1, wherein determining the disaggregation of the total target value comprises: determining a centroid of the (N−1)-dimensional intersection. 5. A method according to claim 4, wherein determining the centroid of the (N−1)-dimensional intersection comprises: determining intersections between the (N−1)-dimensional intersection and edges of the N-polytope. 6. A method according to claim 1, wherein determining the disaggregation of the total target value comprises: determining a coordinate of the (N−1)-dimensional intersection associated with a maximum probability based on N determined prediction intervals. 7. A method according to claim 1, wherein determining the disaggregation of the total target value comprises: determining a line between a minimum coordinate associated with a minimum value of each of the N determined prediction intervals and a maximum coordinate associated with a maximum value of each of the N determined prediction intervals; and determining an intersection point between the line and the (N−1)-dimensional intersection. 8. A non-transitory medium storing processor-executable program code, the program code executable by a processor of a computing device to: determine a total target value associated with N dimension members; determine a set of historical values for each of the N dimension members; for each of the N dimension members, determine a prediction interval based on the set of historical values of the dimension member; determine an N-polytope in N-dimensional space based on the N determined prediction intervals; determine an (N−1)-polytope of the N-dimensional space in which the sum of the N values of each coordinate of the (N−1)-polytope equals the total desired value; determine an (N−1)-dimensional intersection of the N-polytope and the (N−1) polytope; and determine a disaggregation of the total target value among the N dimension members based on the coordinates of the (N−1)-dimensional intersection. 9. A medium according to claim 8, wherein determination of the disaggregation of the total target value comprises: determination of a center of mass of the (N−1)-dimensional intersection. 10. A medium according to claim 9, wherein determination of the center of mass of the (N−1)-dimensional intersection comprises: determination of intersections between the (N−1)-dimensional intersection and edges of the N-polytope. 11. A medium according to claim 8, wherein determination of the disaggregation of the total target value comprises: determination of a centroid of the (N−1)-dimensional intersection. 12. A medium according to claim 11, wherein determination of the centroid of the (N−1)-dimensional intersection comprises: determination of intersections between the (N−1)-dimensional intersection and edges of the N-polytope. 13. A medium according to claim 8, wherein determination of the disaggregation of the total target value comprises: determination of a coordinate of the (N−1)-dimensional intersection associated with a maximum probability based on N determined prediction intervals. 14. A medium according to claim 8, wherein determination of the disaggregation of the total target value comprises: determination of a line between a minimum coordinate associated with a minimum value of each of the N determined prediction intervals and a maximum coordinate associated with a maximum value of each of the N determined prediction intervals; and determination of an intersection point between the line and the (N−1)-dimensional intersection. 15. A system comprising: a memory storing processor-executable program code; and a processor to execute the processor-executable program code in order to cause the computing device to: determine a total target value associated with N dimension members; determine a set of historical values for each of the N dimension members; for each of the N dimension members, determine a prediction interval based on the set of historical values of the dimension member; determine an N-polytope in N-dimensional space based on the N determined prediction intervals; determine an (N−1)-polytope of the N-dimensional space in which the sum of the N values of each coordinate of the (N−1)-polytope equals the total desired value; determine an (N−1)-dimensional intersection of the N-polytope and the (N−1) polytope; and determine a disaggregation of the total target value among the N dimension members based on the coordinates of the (N−1)-dimensional intersection. 16. A system according to claim 15, wherein determination of the disaggregation of the total target value comprises: determination of a center of mass of the (N−1)-dimensional intersection. 17. A system according to claim 15, wherein determination of the disaggregation of the total target value comprises: determination of a centroid of the (N−1)-dimensional intersection. 18. A system according to claim 17, wherein determination of the centroid of the (N−1)-dimensional intersection comprises: determination of intersections between the (N−1)-dimensional intersection and edges of the N-polytope. 19. A system according to claim 15, wherein determination of the disaggregation of the total target value comprises: determination of a coordinate of the (N−1)-dimensional intersection associated with a maximum probability based on N determined prediction intervals. 20. A system according to claim 15, wherein determination of the disaggregation of the total target value comprises: determination of a line between a minimum coordinate associated with a minimum value of each of the N determined prediction intervals and a maximum coordinate associated with a maximum value of each of the N determined prediction intervals; and determination of an intersection point between the line and the (N−1)-dimensional intersection.