A novel branch-and-bound algorithm for solving linear multiplicative programming problems

Cites Work

Global minimization of a generalized linear multiplicative programming
A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
Linear multiplicative programming
Global minimization of a generalized convex multiplicative function
Bilinear separation of two sets in \(n\)-space
Solving long-term financial planning problems via global optimization
A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
Reverse polyblock approximation for generalized multiplicative/fractional programming
Finite algorithm for generalized linear multiplicative programming
BARON: A general purpose global optimization software package
Outer space branch and bound algorithm for solving linear multiplicative programming problems
Underestimation functions for a rank-two partitioning method
A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
Global algorithm for solving linear multiplicative programming problems
A method of acceleration for a class of multiplicative programming problems with exponent
Global optimization of a rank-two nonconvex program
A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
Global optimization algorithm for a generalized linear multiplicative programming
On the minimization of a class of generalized linear functions on a flow polytope
A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
Robust Optimization of Large-Scale Systems
A new solution method for a class of large dimension rank-two nonconvex programs
Global optimization algorithm for solving linear multiplicative programming problems
Convex analysis and global optimization
Introduction to global optimization.
An uncertain support vector machine with imprecise observations
Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound

This page was built for publication: A novel branch-and-bound algorithm for solving linear multiplicative programming problems