Download presentation

Presentation is loading. Please wait.

Published byPayton Shutter Modified about 1 year ago

1
Optimization

2
f(x) = 0 g i (x) = 0 h i (x) <= 0 Objective function Equality constraints Inequality constraints

3
Terminology Feasible set Degrees of freedom Active constraint

4
classifications Unconstrained v. constrained Linear v. non-linear Convex v. concave v. neither Continuous space v. discrete space

5
Linear case Unconstrained makes no sense Simplex method Minimum at a vertex Start at a vertex, jump to adjacent vertex as long as objective is less Uses slack variables to turn inequality constraints Into equality constraints with variable: h(x) – s = 0;

6
Non-linear unconstrained case Unconstrained makes no sense Simplex method Minimum at a vertex Start at a vertex, jump to adjacent vertex as long as objective is less Uses slack variables to turn inequality constraints Into equality constraints with variable: h(x) – s = 0;

7

8

9

10

11

12

13

14

15

16

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google