摘要
系统地讨论了代数多项式的算术- 几何均值定理,并对原型几何规划理论作出了简明的推导与分析。提出了具有缩并迭代特性的几何规划求解理论和编程步骤。还用2 个工程设计的优化求解算例来说明这种缩并迭代几何规划优化求解特点和优点。例1 显示了几何规划的工程实用性和简易性;例2 通过轻型飞机总体方案参数优化,说明所提出的优化方法,可随设计人员思路的变动而得到及时地相适应。
This paper discussed the theorem of the average arithmetic geometric mean of algebraic polynomials systematically, then derived and analyzed the original geometric programming (GP) briefly. In the programming theory the dual conditions of constraint are linear algebraic polynomials, and the dual object function is a nonlinear monomial. The paper presents an approach of reduction and iteration for GP which transforms primary functions of original GP into approximate monomials based on Duffin formula, and dual object function into an approximate linear polynomial. Thus solved dual programming is a linear programming problem and an approximate optimum solution can be obtained simply. By means of iteration approach the real optimum of original GP can be solved. The paper offers the steps of solving process on computer. At the end two examples of sketchy design for airplane (the optimum distribution of aileron supports, the optimum layout of parameters for aircraft global configuration) are explained for solving process and the solutions, compared with the given results. It can be shown that the approach presented in the paper is correct, simple and useful for engineering design, even to Expert System or Artificial Intelligence.
出处
《航空学报》
EI
CAS
CSCD
北大核心
1999年第6期503-508,共6页
Acta Aeronautica et Astronautica Sinica
关键词
优化设计
数学规划
几何规划
飞机设计
optimization design
mathematical programming
geometric programming
airplane design