A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation.
Shao-Jian QuKecun ZhangYing JiPublished in: Appl. Math. Comput. (2007)
Keyphrases
- optimization algorithm
- lagrangian relaxation
- multi objective
- integer programming
- feasible solution
- lower bound
- np hard
- branch and bound algorithm
- optimization method
- dual decomposition
- lower and upper bounds
- differential evolution
- dynamic programming
- linear programming
- particle swarm optimization pso
- column generation
- optimization strategy
- evolutionary multi objective
- relaxation algorithm
- lagrangian heuristic
- nsga ii
- hybrid optimization algorithm
- shortest path
- evolutionary algorithm
- subgradient method
- mixed integer linear programs
- convex optimization
- multiobjective optimization
- multi objective optimization
- machine learning
- hybrid algorithm
- objective function