A branch-and-bound method for a reverse convex programming problem

MaRDI QIDQ2886030zbMATH OpenFDO

Authors Buheerdun, Juhong Liu, Guoqing Chen

Publication date 1 June 2012

Published in Operations Research Transactions (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound methodconeglobal optimization

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cited in

(3)

• A method for solving reverse convex programming problems
• Effective method for constrained minimum - reverse bridge theorem
• Inner approximation method for a reverse convex programming problem

This page was built for publication: A branch-and-bound method for a reverse convex programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2886030)