On the minimization of a quasi-concave function subject to linear constraints

DOI10.1016/0167-6377(91)90030-SzbMath0746.90054OpenAlexW2034333768MaRDI QIDQ1178718

William Colmenares, Ubaldo M. García-Palomares

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90030-s

zbMATH Keywords

quasiconcave functionlinear constraintsouter approximation algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron

Cites Work

• A note on the solution of bilinear programming problems by reduction to concave minimization
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• Concave Minimization Via Collapsing Polytopes
• A Successive Underestimation Method for Concave Minimization Problems

This page was built for publication: On the minimization of a quasi-concave function subject to linear constraints