The method of one dimensional blanking is introduced. The relevant linear programming model is generated by computers. One resolvable method of optimum blanking is put forward.
介绍了一维下料问题的下料方式，采用计算机自动生成相应的线性规划数学模型，给出了最优下料方案的求解方法。
The higher dimensional linear complementary problem is transformed into quadratic (programming), and then decomposed into a series of lower dimensional quadratic programming.
把高维线性互补问题转化为与之等价的高维二次规划问题，然后把高维二次规划问题分解为一系列低维二次规划问题。
By taking the minimum cost as optimization aim, the synthetic factor method, minimum cost method, and linear programming method of solving assembled dimensional chains are introduced.
以最低制造成本为优化目标，介绍了求解装配尺寸链的综合因子法、最低成本法和线性规划法，为合理分配装配尺寸链中各环公差提供参考。
By taking the minimum cost as optimization aim, the synthetic factor method, minimum cost method, and linear programming method of solving assembled dimensional chains are introduced.
以最低制造成本为优化目标，介绍了求解装配尺寸链的综合因子法、最低成本法和线性规划法，为合理分配装配尺寸链中各环公差提供参考。
应用推荐