Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Multidisciplinary design optimization
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Standard form=== Once the design variables, constraints, objectives, and the relationships between them have been chosen, the problem can be expressed in the following form: : find <math>\mathbf{x}</math> that minimizes <math>J(\mathbf{x})</math> subject to <math>\mathbf{g}(\mathbf{x})\leq\mathbf{0} </math>, <math>\mathbf{h}(\mathbf{x}) = \mathbf{0} </math> and <math>\mathbf{x}_{lb}\leq \mathbf{x} \leq \mathbf{x}_{ub} </math> where <math>J</math> is an objective, <math>\mathbf{x}</math> is a [[Vector (geometric)|vector]] of design variables, <math>\mathbf{g}</math> is a vector of inequality constraints, <math>\mathbf{h}</math> is a vector of equality constraints, and <math>\mathbf{x}_{lb}</math> and <math>\mathbf{x}_{ub}</math> are vectors of lower and upper bounds on the design variables. Maximization problems can be converted to minimization problems by multiplying the objective by -1. Constraints can be reversed in a similar manner. Equality constraints can be replaced by two inequality constraints.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)