On Solving Nonconvex Optimization Problems by Reducing The Duality Gap.

Published in: J. Glob. Optim. (2005)

Keyphrases

optimization problems
nonlinear programming
duality gap
inequality constraints
optimality conditions
evolutionary algorithm
exact penalty
combinatorial optimization

metaheuristic
linear programming
objective function
constrained problems
augmented lagrangian
optimization methods
linear programming problems
convex programming

lagrangian dual
knapsack problem
variational inequalities
cost function
linear constraints
equality constraints
constrained optimization problems

convex optimization
traveling salesman problem
semidefinite programming
linear program
fitness function
multi objective
lower bound