A finite branch-and-bound algorithm for linear multiplicative programming

DOI10.1023/A:1011250901810zbMath0983.90075MaRDI QIDQ5947146

Takahito Kuno

Publication date: 7 April 2002

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

global optimizationnonconvex optimizationaffine functions over a polytope

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05)

Related Items (20)

Theoretical and computational results about optimality-based domain reductions ⋮ A method of acceleration for a class of multiplicative programming problems with exponent ⋮ A FPTAS for a class of linear multiplicative problems ⋮ An efficient algorithm for computing a class of multiplicative optimization problem ⋮ Linearization method for a class of multiplicative programming with exponent ⋮ An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems ⋮ A new linearization method for generalized linear multiplicative programming ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ A branch-and-reduce approach for solving generalized linear multiplicative programming ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ A global optimization approach for solving generalized nonlinear multiplicative programming problem ⋮ A convex analysis approach for convex multiplicative programming ⋮ An objective space cut and bound algorithm for convex multiplicative programmes ⋮ A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes ⋮ A branch and bound algorithm for globally solving a class of nonconvex programming problems ⋮ A nonisolated optimal solution of general linear multiplicative programming problems ⋮ Solving generalized convex multiobjective programming problems by a normal direction method ⋮ Approximating a linear multiplicative objective in watershed management optimization

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