2026-09-19T04:29:47Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1124652022-01-13T07:53:53Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Warren W. Hoburg.
Karcher, Cody Jacob
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics.
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
2017-12-05T19:14:02Z
2017-12-05T19:14:02Z
2017
2017
http://hdl.handle.net/1721.1/112465
1011035717
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2017.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 79-82).
Recently, geometric programming has been proposed as a powerful tool for enhancing aircraft conceptual design. While geometric programming has shown promise in early studies, current formulations preclude the designer from using black box analysis codes which are prolific in the aircraft design community. Previous work has shown the ability to fit data from these black box codes prior to the optimization run, however, this is often a time consuming and computationally expensive process that does not scale well to higher dimensional black boxes. Based upon existing iterative optimization methods, we propose a heuristic for including black box analysis codes in a geometric programming framework by utilizing sequential geometric programming (SGP). We demonstrate a heuristic SGP method and apply it to a solar powered aircraft using a black boxed GP compatible profile drag function. Using this heuristic algorithm, we achieve less than a 1% difference in the objective function between a direct implementation of the constraint and a black box implementation of the constraint.
by Cody Jacob Karcher.
S.M.
112 pages
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Aeronautics and Astronautics.
A heuristic for including black box analysis tools into a geometric programming formulation
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="bff1045d-f219-4b03-a19d-5d2dc27bf159">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A heuristic for including black box analysis tools into a geometric programming formulation</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2017</PublicationDate>
<Authors>
<Author>
<DisplayName>Karcher, Cody Jacob</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Aeronautics and Astronautics.</Keyword>
<Abstract>Recently, geometric programming has been proposed as a powerful tool for enhancing aircraft conceptual design. While geometric programming has shown promise in early studies, current formulations preclude the designer from using black box analysis codes which are prolific in the aircraft design community. Previous work has shown the ability to fit data from these black box codes prior to the optimization run, however, this is often a time consuming and computationally expensive process that does not scale well to higher dimensional black boxes. Based upon existing iterative optimization methods, we propose a heuristic for including black box analysis codes in a geometric programming framework by utilizing sequential geometric programming (SGP). We demonstrate a heuristic SGP method and apply it to a solar powered aircraft using a black boxed GP compatible profile drag function. Using this heuristic algorithm, we achieve less than a 1% difference in the objective function between a direct implementation of the constraint and a black box implementation of the constraint.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>