Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints.
Martin E. DyerJohn WalkerPublished in: Math. Program. (1982)
Keyphrases
- linear constraints
- linearly constrained
- nonlinear programming
- lagrangian dual
- quadratic program
- duality gap
- inequality constraints
- convex sets
- optimality conditions
- linear programming
- integer program
- dynamic programming
- cutting plane algorithm
- lagrangian relaxation
- lower and upper bounds
- equality constraints
- integer programming
- linear program
- finite number
- branch and bound
- dual variables
- image processing
- support vector
- optimal solution
- lagrange multipliers
- column generation
- feasible solution