Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
AIRFOIL DESIGN OPTIMIZATION USING THE NAVIER-STOKES EQUATIONS
Date
1994-12-01
Author
Eyi, Sinan
LEE, KD
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
172
views
0
downloads
Cite This
A design optimization technique is presented which couples a computationally efficient Navier-Stokes code with a numerical optimization algorithm. The design method improves the aerodynamic performance of an airfoil subject to specified design objectives and constraints. Recent advances in computers and computational fluid dynamics have permitted the use of the Navier-Stokes equations in the design procedure to include the nonlinear, rotational, viscous physics of transonic flows. Using numerical optimization guarantees that a better design will be produced even with strict design constraints. The method is demonstrated with several examples at transonic flow conditions.
Subject Keywords
Management Science and Operations Research
,
Control and Optimization
,
Applied Mathematics
URI
https://hdl.handle.net/11511/69503
Journal
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
DOI
https://doi.org/10.1007/bf02207637
Collections
Department of Aerospace Engineering, Article
Suggestions
OpenMETU
Core
A new multiobjective simulated annealing algorithm
Tekinalp, Ozan (Springer Science and Business Media LLC, 2007-09-01)
A new multiobjective simulated annealing algorithm for continuous optimization problems is presented. The algorithm has an adaptive cooling schedule and uses a population of fitness functions to accurately generate the Pareto front. Whenever an improvement with a fitness function is encountered, the trial point is accepted, and the temperature parameters associated with the improving fitness functions are cooled. Beside well known linear fitness functions, special elliptic and ellipsoidal fitness functions,...
Discrete size optimization of steel trusses using a refined big bang-big crunch algorithm
Hasançebi, Oğuzhan (Informa UK Limited, 2014-01-02)
This article presents a methodology that provides a method for design optimization of steel truss structures based on a refined big bang-big crunch (BB-BC) algorithm. It is shown that a standard formulation of the BB-BC algorithm occasionally falls short of producing acceptable solutions to problems from discrete size optimum design of steel trusses. A reformulation of the algorithm is proposed and implemented for design optimization of various discrete truss structures according to American Institute of St...
Effective optimization with weighted automata on decomposable trees
Ravve, E. V.; Volkovich, Z.; Weber, Gerhard Wilhelm (Informa UK Limited, 2014-01-02)
In this paper, we consider quantitative optimization problems on decomposable discrete systems. We restrict ourselves to labeled trees as the description of the systems and we use weighted automata on them as our computational model. We introduce a new kind of labeled decomposable trees, sum-like weighted labeled trees, and propose a method, which allows us to reduce the solution of an optimization problem, defined in a fragment of Weighted Monadic Second Order Logic, on such a tree to the solution of effec...
The semismooth approach for semi-infinite programming under the Reduction Ansatz
Stein, Oliver; Tezel, Aysun (Springer Science and Business Media LLC, 2008-06-01)
We study convergence of a semismooth Newton method for generalized semi-infinite programming problems with convex lower level problems where, using NCP functions, the upper and lower level Karush-Kuhn-Tucker conditions of the optimization problem are reformulated as a semismooth system of equations. Nonsmoothness is caused by a possible violation of strict complementarity slackness. We show that the standard regularity condition for convergence of the semismooth Newton method is satisfied under natural assu...
An interactive algorithm to find the most preferred solution of multi-objective integer programs
LOKMAN, BANU; Köksalan, Mustafa Murat; Korhonen, Pekka J.; Wallenius, Jyrki (Springer Science and Business Media LLC, 2016-10-01)
In this paper, we develop an interactive algorithm that finds the most preferred solution of a decision maker (DM) for multi-objective integer programming problems. We assume that the DM's preferences are consistent with a quasiconcave value function unknown to us. Based on the properties of quasiconcave value functions and pairwise preference information obtained from the DM, we generate constraints to restrict the implied inferior regions. The algorithm continues iteratively and guarantees to find the mos...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Eyi and K. LEE, “AIRFOIL DESIGN OPTIMIZATION USING THE NAVIER-STOKES EQUATIONS,”
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
, pp. 447–461, 1994, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/69503.