期刊文献+

某链条拉式平衡机优化设计

Optimum Design of a Chain Equilibrator
下载PDF
导出
摘要 针对某链条拉式平衡机设计效率低、优化设计难度大的现状,建立该类平衡机不平衡力矩数学模型并进行优化设计.研究了该链条拉式平衡机的设计过程,用直角坐标系中曲线方程描述链条几何位置,建立了不平衡力矩的数学模型.考虑各种使用工况,建立平衡机优化设计目标函数和约束条件,形成了平衡机优化设计数学模型.基于SQP方法,编制优化设计计算程序,得到了优化设计结果.该链条拉式平衡机优化设计结果表明:优化后不平衡力矩均降低,将有效减低高低机手轮力、随动功率,且极大提高了设计效率. Aimed at the poor design efficiency and difficult optimum design,the mathematic modal of unbalance moment of chain equilibrator was established and optimized.Studying the design process and describing the position of chain with curvilinear equation in rectangular coordinate system,the mathematic modal of unbalance moment of chain equilibrator was established.Considering various working conditions,the objective function and constraint conditions of optimum design of equilibrator were established,as well as the mathematic model was formed.Based on SQP method,the program of optimum design was generated and the optimum result was obtained.The results indicate that the unbalance moments is reduced,which reduces the handwheel force of elevating and the power of following,thus the design efficiency is greatly increased.
出处 《中北大学学报(自然科学版)》 CAS 北大核心 2016年第4期381-385,共5页 Journal of North University of China(Natural Science Edition)
关键词 链条拉式平衡机 不平衡力矩 优化设计 逐步二次规划 chain equilibrator unbalance moment optimum design SQP
  • 相关文献

参考文献1

二级参考文献8

  • 1BNR-ON R,GRASSE K A. Global optimization of a quadratic function with quadratic equality constraints Part2 [J]. Journal of Optimization Theory and Applications, 1997,93: 543-556.
  • 2RABER U. A simplicial branch-and-bound method for solving nonconvex all-quadratic programs [J]. Journal of Global Optimization, 1998,13: 417-432.
  • 3YIN Y Y. Approximating quadratic programming with bound and quadratic constraints [J]. Mathematics Programming, 1999,84: 219-286.
  • 4Y'IN Y Y. Approximating global quadratic optimization with convex quadratic constraints [J]. Journal of Global Optimization, 1999,15: 1-17.
  • 5HOAI L T. An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints [J]. Mathematics Programming, 2000,87 : 401-426.
  • 6AUDET C, HANSEN P, JAUMARD B, et al. A branch and cut algorithm for nonconvex Quadratically constrained quadratic programming [J]. Mathematics Programming, 2000, 87 131-152.
  • 7AL-KHAYYAL F A,FALK J E. Jointly constrained biconvex programming [J]. Mathematics of Operations Research, 1983, 8: 273-283.
  • 8RYOO H S, SAHINIDIS N V. Global optimization of multiplicative programs [J]. Journal of Global Optimization, 2003, 26:387-418.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部