Lagrangian Techniques for Solving a Class of Zero-One Integer Linear Programs.
Yao-Jen ChangBenjamin W. WahPublished in: COMPSAC (1995)
Keyphrases
- linear program
- simplex method
- lagrange multipliers
- linear programming problems
- linear programming
- optimal solution
- lagrangian dual
- integer program
- quadratic program
- semi infinite
- interior point methods
- extreme points
- mixed integer program
- stochastic programming
- np hard
- column generation
- convex optimization problems
- lp relaxation
- primal dual
- objective function
- convex functions
- dynamic programming
- dual variables
- mixed integer
- interior point
- simplex algorithm
- lagrangian relaxation
- convex optimization
- mixed integer linear program
- nelder mead
- nonlinear programming
- branch and bound algorithm
- multi objective
- lower bound