Lagrangian dual ascent by generalized linear programming

DOI10.1016/0167-6377(89)90059-XzbMath0676.90035OpenAlexW2031583508MaRDI QIDQ1123118

Donald W. Hearn, Siriphong Lawphongpanich

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90059-x

zbMATH Keywords

decompositionLagrangian dual problemascent propertyGeneralized linear programmingnondifferentiable points

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition Principle for Linear Programs
• The Decomposition Algorithm for Linear Programs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Generalized Linear Programming Solves the Dual
• Convergence Conditions for Nonlinear Programming Algorithms
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Minimization of unsmooth functionals