Linear programs with an additional rank two reverse convex constraint

DOI10.1007/BF01099268zbMath0802.90084OpenAlexW2081668222WikidataQ61638391 ScholiaQ61638391MaRDI QIDQ1327432

Hoang Tuy, Ulrich Pferschy

Publication date: 19 June 1994

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01099268

zbMATH Keywords

reverse convex programmingquasiconcave function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Linear programming (90C05)

Related Items

Branch-and-reduce algorithm for convex programs with additional multiplicative constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Mathematical programs with a two-dimensional reverse convex constraint
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• The complementary convex structure in global optimization
• A parametric successive underestimation method for convex multiplicative programming problems
• A global optimization approach for the linear two-level program
• Linear multiplicative programming
• On the complexity of four polyhedral set containment problems
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• An efficient solution method for rank two quasiconcave minimization problems