Nonconvex Quadratic Programs, Linear Complementarity Problems, and Integer Linear Programs.
Franco GiannessiE. TomasinPublished in: Optimization Techniques (1973)
Keyphrases
- quadratic program
- linear program
- linear complementarity problem
- objective function
- linear programming
- convex functions
- interior point
- convex optimization
- optimal solution
- mixed integer
- interior point methods
- optimization problems
- simplex method
- dynamic programming
- np hard
- linear programming problems
- column generation
- primal dual
- integer program
- computational complexity
- lower bound
- lp relaxation
- integer programming
- sufficient conditions
- worst case
- bayesian networks