Kolmogorov–Zurbenko filter
Vector optimization is an optimization problem of simultaneously optimizing multiple objective functions subject to constraints and a given ordering. Any multi-objective optimization problem is a vector optimization problem with the trivial ordering.
Canonical example
In mathematical terms, the vector optimization problem can be written as:
where for some vector spaces , , is an ordering cone in , and denotes minimizing with respect to the ordering cone.
The solution to this minimization problem is the smallest set such that for every there exists a where and .
Solution types
- is a weakly efficient point (w-minimizer) if there exists a neighborhood around such that for every it follows that .
- is an efficient point (e-minimizer) if there exists a neighborhood around such that for every it follows that .
- is a properly efficient point (p-minimizer) if is a weakly efficient point with respect to a closed pointed convex cone where .
Every p-minimizer is an e-minimizer. And every e-minimizer is a w-minimizer.[1]
Solution methods
- Benson's algorithm for linear vector optimization problems[2]
Relation to multi-objective optimization
Any multi-objective optimization problem can be written as
where and is the positive orthant of . Thus the solution set of this vector optimization problem is given by the Pareto efficient points.
References
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.
- ↑ Template:Cite doi
- ↑ 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534