A survey of methods of abstract convex programming

DOI10.1080/09720510.2002.10701049zbMath1079.90584OpenAlexW2316231643MaRDI QIDQ5708462

Mikhail Andramonov

Publication date: 18 November 2005

Published in: Journal of Statistics and Management Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720510.2002.10701049

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Programming in abstract spaces (90C48)

Related Items (2)

Duality for composite optimization problem within the framework of abstract convexity ⋮ Zero duality gap conditions via abstract convexity

This page was built for publication: A survey of methods of abstract convex programming