Branch-and-bound decomposition approach for solving quasiconvex-concave programs

Related Items

A fifth bibliography of fractional programming^*, Lagrange duality and partitioning techniques in nonconvex global optimization

Cites Work

Unnamed Item
Unnamed Item
Optimization of pipe networks
Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
Constrained global optimization: algorithms and applications
Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
Method for minimizing a convex-concave function over a convex set
Parametric simplex algorithms for solving a special class of nonconvex minimization problems
An all-linear programming relaxation algorithm for optimizing over the efficient set
On-line and off-line vertex enumeration by adjacency lists
On solving a d.c. programming problem by a sequence of linear programs
A global optimization approach for solving the convex multiplicative programming problem
A parametric successive underestimation method for convex multiplicative programming problems
A new reformulation-linearization technique for bilinear programming problems
A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
Global minimization of a difference of two convex functions
An efficient solution method for rank two quasiconcave minimization problems
Algorithms for the vector maximization problem
Convex Analysis
Optimization over the efficient set