发明名称 OPTIMIZING DEVICE FOR CONVEX PLAN PROBLEM
摘要 <p>PROBLEM TO BE SOLVED: To shorten a processing time by repeating the movement of an operation point when its movement quantity is larger than a specific value and finding the position of an operation point having the best evaluation function value to satisfy an inequality restriction and a linear equality restriction. SOLUTION: An operation point moving means 2d moves an operation point in the moving direction and by the movement quantity calculated by an operation point moving direction and quantity calculating means 2c, and when the movement quantity of the operation point is smaller than a specific value, a moving end decision means 2e ends the moving and outputs the current position of the operation point to a result output means 2f. When the movement quantity of the operation point is larger than the specific value, the current position of the operation point is supplied to the means 2c and the movement of the operation point is repeated to find the position of the operation point having the best evaluation function value to satisfy an inequality restriction and a linear equality restriction.</p>
申请公布号 JPH11219348(A) 申请公布日期 1999.08.10
申请号 JP19980022101 申请日期 1998.02.03
申请人 MITSUBISHI ELECTRIC CORP 发明人 NAKAMURA SHIZUKA;HIROSE KOICHI
分类号 G06F17/10;G06F17/00;G06F19/00;G06Q10/04;G06Q50/00;G06Q50/06;(IPC1-7):G06F17/00 主分类号 G06F17/10
代理机构 代理人
主权项
地址