A nontangential cutting plane algorithm

DOI10.1016/S0167-6377(02)00104-9zbMath1018.90032OpenAlexW2049487365MaRDI QIDQ1612001

Siriphong Lawphongpanich

Publication date: 28 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00104-9

zbMATH Keywords

decompositionconvex programlarge-scale systemcutting plane algorithmLagrangian dual problem

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Uses Software

• CPLEX
• GAMS
• MINOS

Cites Work

• Unnamed Item
• Decomposition Principle for Linear Programs
• Linear Programming
• Inexact Cuts in Benders Decomposition
• Convergence Conditions for Nonlinear Programming Algorithms

This page was built for publication: A nontangential cutting plane algorithm