On highly robust efficient solutions to uncertain multiobjective linear programs.
Garrett M. DranichakMargaret M. WiecekPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- linear program
- highly robust
- efficient solutions
- multi objective
- optimal solution
- bi objective
- objective function
- pareto optimal solutions
- linear programming
- optimization algorithm
- multi objective optimization
- evolutionary algorithm
- semi infinite
- stochastic programming
- nsga ii
- simplex method
- heuristic methods
- multiobjective optimization
- efficient frontier
- genetic algorithm
- np hard
- search space
- dynamic programming
- column generation
- interior point methods
- linear inequalities
- multiple objectives
- mixed integer
- integer program
- branch and bound algorithm
- primal dual
- extreme points
- pareto optimal
- partial occlusion
- knapsack problem
- feasible solution
- simplex algorithm
- lower bound
- set covering problem
- mixed integer linear program
- particle swarm optimization
- branch and bound
- optimization problems
- fitness function