Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs.
Miguel A. GobernaVaithilingam JeyakumarGuoyin LiJosé Vicente-PérezPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- highly robust
- efficient solutions
- convex programs
- multi objective
- bi objective
- bicriteria
- pareto optimal solutions
- evolutionary algorithm
- optimization algorithm
- multi objective optimization
- objective function
- multiobjective optimization
- optimal solution
- heuristic methods
- particle swarm optimization
- genetic algorithm
- multiple objectives
- convex functions
- nsga ii
- multi objective evolutionary algorithms
- pareto optimal
- problems in computer vision
- dynamic programming