Outer space branch and bound algorithm for solving linear multiplicative programming problems
type: Item
instance of: scholarly article
title: Outer space branch and bound algorithm for solving linear multiplicative programming problems
zbMATH Open document ID: 1465.90102
author: Kai-Min Wang
author: Ting Lu
author: Peiping Shen
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 7340606
zbMATH Keywords: linear multiplicative programming
zbMATH Keywords: global optimization
zbMATH Keywords: linear relaxation
zbMATH Keywords: branch and bound
describes a project that uses: BARON
describes a project that uses: CPLEX
describes a project that uses: CVX
MaRDI profile type: Publication
full work available at URL: s10898-020-00919-7
OpenAlex ID: W3037338687
cites work: Convex analysis and global optimization
cites work: Global optimization algorithm for mixed integer quadratically constrained quadratic program
cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
cites work: Q4352213
cites work: BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
cites work: BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
cites work: Solving long-term financial planning problems via global optimization
cites work: Branch-reduction-bound algorithm for generalized geometric programming
cites work: Range division and contraction algorithm for a class of global optimization problems
cites work: Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization
cites work: Robust Optimization of Large-Scale Systems
cites work: Generalized convexity and optimization. Theory and applications
cites work: On the minimization of a class of generalized linear functions on a flow polytope
cites work: A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
cites work: An Eﬃcient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem
cites work: Range division and compression algorithm for quadratically constrained sum of quadratic ratios
cites work: Finite algorithm for generalized linear multiplicative programming
cites work: An outcome space approach for generalized convex multiplicative programs
cites work: Linear decomposition approach for a class of nonconvex programming problems
cites work: Range division and linearization algorithm for a class of linear ratios optimization problems
cites work: Outcome-space cutting-plane algorithm for linear multiplicative programming
cites work: A nonisolated optimal solution of general linear multiplicative programming problems
cites work: A global optimization approach for solving generalized nonlinear multiplicative programming problem
cites work: Global optimization of multiplicative programs
cites work: Global minimization of a generalized linear multiplicative programming
cites work: Global optimization for generalized linear multiplicative programming using convex relaxation
cites work: An efficient algorithm for globally solving generalized linear multiplicative programming
cites work: Global optimization of a rank-two nonconvex program
cites work: Global optimization algorithm for a generalized linear multiplicative programming
cites work: Global optimization method for linear multiplicative programming
cites work: A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
cites work: Global algorithm for solving linear multiplicative programming problems
cites work: Semidefinite Programming
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: BARON: A general purpose global optimization software package
cites work: An FPTAS for minimizing the product of two non-negative linear cost functions
cites work: \(NP\)-hardness of linear multiplicative programming and related problems
DOI: 10.1007/S10898-020-00919-7
Recommended article: An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems
Recommended article: Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
Recommended article: Q5503469
Recommended article: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
Recommended article: An outcome-space finite algorithm for solving linear multiplicative programming
Recommended article: Q5128210
Recommended article: An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
Recommended article: Outcome-space cutting-plane algorithm for linear multiplicative programming
Recommended article: Q5382214
Recommended article: Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
description: scientific article; zbMATH DE number 7340606