A finite algorithm for globally optimizing a class of rank-two reverse convex programs

DOI10.1023/A:1008216024699zbMath0905.90135OpenAlexW1584713557MaRDI QIDQ1387650

Yoshitsugu Yamamoto, Takahito Kuno

Publication date: 10 February 1999

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

Full work available at URL: https://doi.org/10.1023/a:1008216024699

zbMATH Keywords

global optimizationnonconvex problemparametric simplex algorithmadditional rank-two reverse convex constraintrank-two quasiconcave function

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05)

Related Items

Global optimization for special reverse convex programming ⋮ Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint ⋮ A nonisolated optimal solution for special reverse convex programming problems ⋮ Branch-and-reduce algorithm for convex programs with additional multiplicative constraints