Outer space branch and bound algorithm for solving linear multiplicative programming problems
From MaRDI portal
Publication:2022174
DOI10.1007/s10898-020-00919-7zbMath1465.90102OpenAlexW3037338687MaRDI QIDQ2022174
Ting Lu, Kai-Min Wang, Pei-Ping Shen
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00919-7
Nonlinear programming (90C30) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (8)
Solving linear multiplicative programs via branch-and-bound: a computational experience ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems ⋮ A new deterministic global computing algorithm for solving a kind of linear fractional programming ⋮ Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound ⋮ A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
Uses Software
Cites Work
- Unnamed Item
- Range division and contraction algorithm for a class of global optimization problems
- Global minimization of a generalized linear multiplicative programming
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- Linear decomposition approach for a class of nonconvex programming problems
- An FPTAS for minimizing the product of two non-negative linear cost functions
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization
- An efficient algorithm for globally solving generalized linear multiplicative programming
- Generalized convexity and optimization. Theory and applications
- An outcome space approach for generalized convex multiplicative programs
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- A nonisolated optimal solution of general linear multiplicative programming problems
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Solving long-term financial planning problems via global optimization
- Global optimization of multiplicative programs
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Global optimization for generalized linear multiplicative programming using convex relaxation
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- Finite algorithm for generalized linear multiplicative programming
- BARON: A general purpose global optimization software package
- Global algorithm for solving linear multiplicative programming problems
- Global optimization method for linear multiplicative programming
- Global optimization of a rank-two nonconvex program
- Branch-reduction-bound algorithm for generalized geometric programming
- Global optimization algorithm for a generalized linear multiplicative programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- 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
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem
- Robust Optimization of Large-Scale Systems
- Semidefinite Programming
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Convex analysis and global optimization
This page was built for publication: Outer space branch and bound algorithm for solving linear multiplicative programming problems
