Login / Signup

A parametric programming methodology to solve the lagrangian dual for network problems with multiple side-constraints.

Noel Bryson
Published in: Comput. Oper. Res. (1993)
Keyphrases
  • lagrangian dual
  • lower and upper bounds
  • linear programming
  • dual variables
  • integer program
  • lagrangian relaxation
  • cutting plane algorithm
  • duality gap
  • genetic algorithm
  • multi objective
  • upper bound
  • linear program