An efficient solution method for rank two quasiconcave minimization problems
From MaRDI portal
Publication:4327903
DOI10.1080/02331939208843778zbMath0817.90079OpenAlexW2031855518MaRDI QIDQ4327903
Publication date: 27 March 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843778
Related Items
Linear programs with an additional rank two reverse convex constraint, Branch-and-bound decomposition approach for solving quasiconvex-concave programs, Multiplicative programming problems: Analysis and efficient point search heuristic, A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, The complementary convex structure in global optimization, A global optimization approach for solving the convex multiplicative programming problem, A vector linear programming approach for certain global optimization problems, Minimizing the sum of a convex function and a specially structured nonconvex function, Strongly polynomial algorithm for a production-transportation problem with concave production cost, The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs, Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions, \(NP\)-hardness of linear multiplicative programming and related problems, Outcome-space cutting-plane algorithm for linear multiplicative programming, Level set algorithm for solving convex multiplicative programming problems, Strongly polynomial algorithm for two special minimum concave cost network flow problems, Strongly polynomial time algorithms for certain concave minimization problems on networks
Cites Work
