Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.
-
Upload
charla-paul -
Category
Documents
-
view
213 -
download
0
Transcript of Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.
![Page 1: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/1.jpg)
Vector Optimization
Study Guide for ES205
Yu-Chi HoJonathan T. LeeJan. 12, 2001
![Page 2: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/2.jpg)
2
Outline Problem Statement Motivation Pareto Optimality Scalarization Nonconvex S’ Numerical Methods
![Page 3: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/3.jpg)
3
Problem Statement
where S is the feasible set in n and J is the objective function, J: S m and ,S’ is the feasible performance region.
)(max xJSx
N
xJxJxJ m,...,1
J1
J2
S’
![Page 4: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/4.jpg)
4
Motivation Many real world problems require to
optimize multiple criteria at the same time.• Find the optimal path of an airplane
flight while minimizing both the time it takes and the fuel consumption.
• Buying a car with the best quality while spending the lowest amount of money.
N
![Page 5: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/5.jpg)
5
Pareto Optimality x’ S is a Pareto optimum if there is
no x S such that Ji(x) Ji(x’) for all i = 1, …, m and Ji(x) > Ji(x’) for some i.
The “best that could be achieved without disadvantaging at least one group.” (Allan Schick, in Louis C. Gawthrop, 1970, p.32)
N
![Page 6: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/6.jpg)
6
Pareto Optimality (cont.) m = 2
Pareto frontier:the set ofPareto optimum
N
J1(x) J1(x’)J2(x) J2(x’)x’
J1
J2
S’
![Page 7: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/7.jpg)
7
Scalarization
for i > 0, i = 1, …, m.
To “summarize” the multiple criteria into a single criterion — scalar-valued optimization problem.
m
iii
SxxJ
1
max
![Page 8: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/8.jpg)
8
Scalarization (cont.) m = 2
J1
J2x’ 1J1 + 2J2
N
S’
![Page 9: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/9.jpg)
9
Nonconvex S’ Only two of the optimal points could
be identify through scalarization
J1
J2
S’
N
![Page 10: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/10.jpg)
10
Constraint Optimization Pb.
max J1(x)s.t. J2(x) for different
N
J1
J2
S’
![Page 11: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/11.jpg)
11
Nonconvex S’ (cont.)
J1
max min [J1, J2]
N
J2
S’
x’
![Page 12: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/12.jpg)
12
Nonconvex S’ (cont.)
N
J1
J2
S’
x:AspirationPoint
x’
xxAxx T
Sx
''min
''
![Page 13: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/13.jpg)
13
Numerical Methods Linear Programming: both the
objective function and the constraints are linear
Non-linear programming
![Page 14: Vector Optimization Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Jan. 12, 2001.](https://reader035.fdocuments.net/reader035/viewer/2022071806/56649f575503460f94c7b79b/html5/thumbnails/14.jpg)
14
References:
• Heylighen, F., Web Dictionary of Cybernetics and Systems, http://pespmc1.vub.ac.be/ASC/.
• Ho, Y.-C., “Optimization – A Many-Splendored Thing –,” slides presented at IFAC World Congress, 1999.
• Jahn, J., “Theory of Vector Maximization: Various Concepts of Efficient Solutions,” in Chapter 2 of Multicriteria Decision making – Advances in MCDM Models, Algorithms, Theory, and Applications by T. Gal, T.J. Stewart and T. Hanne, Kkuwer, 1999.
• Mas-Colell, A., M. D. Whinston and J. R. Green, Microeconomic Theory, Oxford University Press, 1995.