A Concurrency of Employment Agencies Applicable to Fuding Optimization Model

Abstract

The direct contraction method of definite generalized polynomial formation model, because the negative definite programming is non-convex programming, it is difficult to find the global optimal solution, the author chooses the appropriate step factor, and the cutting plane method can still find the optimal solution. In the iterative process, sometimes there will be negative value points far away from the feasible region, which makes it impossible to continue the iteration. This paper uses the method of negative cutting to deal with it.