A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality

This publication has 30 references indexed in Scilit:

• An algorithm for finding the shortest element of a polyhedral set with application to lagrangian duality
  Journal of Mathematical Analysis and Applications, 1978
• A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
  Journal of Optimization Theory and Applications, 1978
• The traveling salesman problem: A duality approach
  Mathematical Programming, 1977
• Geometry and resolution of duality gaps
  Naval Research Logistics Quarterly, 1973
• Algorithms for some minimax problems
  Journal of Computer and System Sciences, 1968
• An Infeasibility-Pricing Decomposition Method for Linear Programs
  Operations Research, 1966
• The Theory of Max-Min, with Applications
  SIAM Journal on Applied Mathematics, 1966
• Optimal Programming of Lot Sizes, Inventory and Labor Allocations
  Management Science, 1965
• The Decomposition Algorithm for Linear Programs
  Econometrica, 1961
• The Relaxation Method for Linear Inequalities
  Canadian Journal of Mathematics, 1954