Patent Document ID: 5440675
Application ID: 08341971
Patent Flag: 1

Claim One:
1. A method of analyzing resource allocation to a linear programming model of a graph consisting of nodes representing the status and branches representing the status transition and including at least one closed loop, which comprises: a step 1 of classifying all nodes contained in said graph into patterns, each having a given priority, based on a state of weights given to input and output branches of each node; a step 2 of selecting a node i from which to start a determination of the weight to each branch from among all of nodes in the graph based on results of classification in step 1; a step 3 of weighting all of input branches and output branches of the selected node i so that y.ident..SIGMA..sub.j X.sub.ji +.SIGMA..sub.j X.sub.ij is minimized under a constraint represented by the following equation (1): EQU .SIGMA..sub.j X.sub.ij -.SIGMA..sub.j X.sub.ji =0 EQU X.sub.ij .gtoreq.0 wherein X.sub.ji is a weight of an input branch from node j to node 1 and X.sub.ij is a weight of an output branch from node i to node j; a step 4 of selecting a node of which input and output branches are to be weighted next time based on a state obtained by executing step 3; a step 5 of determining weights of all input and output branches in accordance with a method corresponding to that of step 3; and a step 6 of repeating steps 4 and 5 to determine weights of input and output branches for remaining nodes.