| 摘要 |
<p>PURPOSE: To attain the optimum allocation of resources in a system under control by fast calculating the optimum solution of a linear programming model. CONSTITUTION: A linear programming model is produced, and a practicable start point 51 is selected inside a polyhedron 50 and set at the present iterative value. Then, a variable is selected to normalize the present iterative value, and the most slope-down direction is calculated in a new variable. The present iterative value is stepped in the most slope-down direction, and the new iterative value is set at the present iterative value and iterated as long as the object function rises. This iteration is carried on until the new iterative value is approximated to the optimum solution.</p> |
