Lagrangian dual ascent by generalized linear programming
From MaRDI portal
Publication:1123118
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
decompositionLagrangian dual problemascent propertyGeneralized linear programmingnondifferentiable points
Related Items
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