Epsilon-subgradient optimization techniques in convex programming and Lagrangian duality

zbMath0597.90060MaRDI QIDQ1079495

B. George

Publication date: 1986

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

heuristiccutting planes\(\epsilon \) -subgradientapproximately solving convex programsrelaxed Lagrangian dual

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Integer programming (90C10)

This page was built for publication: Epsilon-subgradient optimization techniques in convex programming and Lagrangian duality