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

heuristic; cutting planes; \(\epsilon \) -subgradient; approximately solving convex programs; relaxed Lagrangian dual

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C10: Integer programming