Strengthening of lower bounds in the global optimization of Bilinear and Concave Generalized Disjunctive Programs.
Juan P. RuizIgnacio E. GrossmannPublished in: Comput. Chem. Eng. (2010)
Keyphrases
- global optimization
- lower bound
- objective function
- answer sets
- upper bound
- piecewise linear
- ant colony algorithm
- particle swarm optimization
- branch and bound
- pso algorithm
- global search
- logic programs
- evolutionary programming
- global solution
- lower and upper bounds
- global optima
- worst case
- np hard
- inverse problems
- vc dimension
- convex functions
- imperialist competitive algorithm
- image completion
- deterministic annealing
- search capabilities
- linear programming
- optimal solution