Approximating Pareto curves using semidefinite relaxations.

Victor Magron Didier Henrion Jean-Bernard Lasserre

Published in: Oper. Res. Lett. (2014)

Keyphrases

semidefinite
semidefinite programming
convex relaxation
multi objective
interior point methods
sufficient conditions
genetic algorithm
higher dimensional
convex sets
differential evolution
globally optimal
objective function
dynamic programming
convex hull
primal dual
finite dimensional