Vector optimization

Vector optimization is a subarea of mathematical optimization where optimization problems with vector-valued objective functions are optimized with respect to a given partial ordering and subject to certain constraints. A multi-objective optimization problem is a special case of a vector optimization problem: The objective space is the finite dimensional Euclidean space partially ordered by the component-wise "less than or equal to" ordering.

Problem formulation

In mathematical terms, a vector optimization problem can be written as:

C−⁡minx∈Sf(x)

where f:X→Z for a partially ordered vector space Z. The partial ordering is induced by convex cone C⊆Z. X is an arbitrary set and S⊆X is called the feasible set.

Solution concepts

There are different minimality notions, among them:

Every proper minimizer is a minimizer. And every minimizer is a weak minimizer.

Modern solution concepts not only consists of minimality notions but also take into account infimum attainment.

Solution methods

Relation to multi-objective optimization

Any multi-objective optimization problem can be written as

ℝ+d−⁡minx∈Mf(x)

where f:X→ℝd and ℝ+d is the non-negative orthant of ℝd. Thus the minimizer of this vector optimization problem are the Pareto efficient points.