Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
10 Cards in this Set
- Front
- Back
|
Optimization field roadmap Two types of Optimization 1) ________ optimization - Combinatorial optimization - integer programming 2) _______ optimization - linear and nonlinear programing - convex optimization vs non-convex optimization - stochastic programming |
Discrete vs continuous |
|
|
Combinatorial optimization |
d |
|
|
Integer programming |
d |
|
|
Linear programming |
It is always convex programming |
|
|
Non-linear programming is a class of optimization problem where ___________ or __________ is not __________. |
An optimization problem where either the objective function or constraints is not linear |
|
|
More types of continuous programming - fractional programming - stochastic optimization Additionally, if there are two or more objective functions, then multi-objective optimization |
d |
|
|
List some examples of non-linear programming. (2) |
quadratic programming, fractional programming |
|
|
Non-linear programmings are __________ convex |
sometimes |
|
|
List some examples of convex programming : |
linear programming semidefinite programming conic programming geometric programming |
|
|
When a program is convex, a locally optimal solution is ______________ globally optimal |
always |
