首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种处理多学科优化问题的通用和有效方法
引用本文:王晓慧,夏人伟.一种处理多学科优化问题的通用和有效方法[J].宇航学报,2006,27(5):1050-1053.
作者姓名:王晓慧  夏人伟
作者单位:北京航空航天大学宇航学院,北京,100083
摘    要:提出将多学科设计优化问题按单级优化来处理,并利用包络对偶法直接对其进行优化运算。通过对一道测试和评价多学科优化方法有效性的典型算题的计算和求解,显示了该方法处理多学科优化问题具有收敛速度快、计算效率高、并具有通用性等特点。

关 键 词:多学科设计优化  包络对偶法  二次规划问题算法
文章编号:1000-1328(2006)05-1050-04
收稿时间:05 15 2006 12:00AM
修稿时间:2006-05-152006-07-20

A General and Efficient Method for Multidisciplinary Design Optimization Problems
WANG Xiao-hui,XIA Ren-wei.A General and Efficient Method for Multidisciplinary Design Optimization Problems[J].Journal of Astronautics,2006,27(5):1050-1053.
Authors:WANG Xiao-hui  XIA Ren-wei
Institution:School of Astronautics, Beihang University, Beijing 100083, China
Abstract:In this paper,we propose that the Multidisciplinary Design Optimization(MDO) problem should be formulated as a single-level optimization problem and solved by Enveloped Dual Method.The method is demonstrated on a typical example problem for testing and evaluating the MDO methods.Results show that the proposed method improves the convergence speed,computational efficiency and applicability of MDO problems.
Keywords:Multidisciplinary design optimization(MDO)  The enveloped dual method  Algorithm of quadratic programming problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号