A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem.
Inês SoaresMaria João AlvesCarlos Henggeler AntunesPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- global optimization
- mixed integer
- bi level
- mixed integer program
- lot sizing
- benders decomposition
- feasible solution
- linear program
- particle swarm optimization
- gray scale
- convex hull
- constrained global optimization
- continuous relaxation
- pso algorithm
- upper bound
- continuous variables
- optimal solution
- multistage
- global search
- search algorithm
- linear programming
- co occurrence
- multi objective
- evolutionary algorithm