Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangean Dual to characterize optimality conditions
Prabhu ManyemPublished in: CoRR (2009)
Keyphrases
- optimality conditions
- duality gap
- lower bound
- optimization problems
- nonlinear programming
- objective function
- upper bound
- natural language
- inequality constraints
- karush kuhn tucker
- evolutionary algorithm
- linear programming
- branch and bound
- metaheuristic
- optimal solution
- branch and bound algorithm
- np hard
- combinatorial optimization problems
- knapsack problem
- semi infinite programming
- cost function
- equality constraints
- lower level
- traveling salesman problem
- worst case
- sample size
- combinatorial optimization
- linear constraints
- variational inequalities
- column generation
- higher level
- feasible solution
- primal dual
- max sat
- linear programming relaxation
- supervised learning
- multi agent systems