| 摘要 |
PROBLEM TO BE SOLVED: To shorten a calculating time by suppressing the number of constraint inequalities applied to linear programming. SOLUTION: This estimating device first calculates a provisional solution z<SB>j</SB>by using an initial constraint. Next, the device creates a set of indexes j showing a column in which a matrix element is not zero, and classifies the set of j into a set S<SB>0</SB>and a set S<SB>1</SB>. Then, the device performs adjustment so that the number of j classified into S<SB>1</SB>is an odd number when an intercept of a linear equation is zero and that the number of j classified into S<SB>1</SB>is an even number when the intercept is one. As a result of the adjustment, it is determined whether the total sum of an added value obtained by adding distances between all provisional solutions z<SB>j</SB>corresponding to j that turns out to belong to S<SB>1</SB>and one, and an added value obtained by adding distances between all provisional solutions z<SB>j</SB>corresponding to j that turns out to belongs to S<SB>0</SB>and zero is one or larger. When the total sum is not one or larger as a result of the determination, a cutting inequality is extracted on the basis of inequality used for the determination and added to the set of constraint inequalities. COPYRIGHT: (C)2011,JPO&INPIT
|
