| 摘要 |
<p>PURPOSE:To provide a means which can effectively solve an optimization problem as well as a combination limit sufficiency problem where a variable has the discrete value by making the best use of the failure information obtained in a processing state. CONSTITUTION:A computer 100 includes an initial limit violating inequality generating part 102 which generates a limit violating inequality that is opposite to an inequality system (inequality, equality) 101 meaning a limitation instructed externally, a variable value changing part 104 which changes the value of the variable that checks the limit sufficiency to other value from the present value, a variable value selecting part 105 which selects the value of the variable whose value is not decided, and a limit violating condition generating part 106 which generates the new limit violating conditions of the AND of a simplified inequality by turning the variable emerging in the limit violating inequality or in the limit violating conditions generated from the inequality into the numerical value if all values don't satisfy the limitation through the treatments of both parts 104 and 105. Then these obtained limit violating conditions are stored in a limit violating condition storing part 103.</p> |
