Global Optimality Conditions for Discrete and Nonconvex Optimization - With Applications to Lagrangian Heuristics and Column Generation.
Torbjörn LarssonMichael PatrikssonPublished in: Oper. Res. (2006)
Keyphrases
- column generation
- global optimality
- optimal solution
- global optimization
- linear program
- dual variables
- lagrange multipliers
- lagrangian relaxation
- objective function
- vehicle routing
- branch and bound
- linear programming
- convex functions
- heuristic methods
- globally optimal
- optimization problems
- set partitioning
- integer programming
- nonlinear programming
- decision variables
- sufficient conditions
- optimality conditions
- metaheuristic
- np hard
- search space
- exact solution
- convex optimization problems
- search algorithm
- convex optimization
- discrete optimization
- knapsack problem
- exact algorithms
- feasible solution
- lower bound
- convex programming
- cutting plane algorithm
- cost function
- multi objective
- constraint programming
- semidefinite
- particle swarm optimization
- quadratic programming
- combinatorial optimization problems
- computational complexity
- global optimum
- energy function