An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs

DOI10.1016/J.CAM.2024.116035zbMATH Open1542.90231MaRDI QIDQ6581973FDOQ6581973

Authors: Yanzhen Zhang, Peiping Shen, Bingdi Huang, Ya-ping Deng 

Publication date: 1 August 2024

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Recommendations

• Global optimization algorithm for a generalized linear multiplicative programming
• A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems
• Global algorithm for solving linear multiplicative programming problems
• An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
• A novel branch-and-bound algorithm for solving linear multiplicative programming problems

zbMATH Keywords

global optimizationconvex relaxationbranch-and-boundlinear multiplicative programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• BARON: A general purpose global optimization software package
• The bargaining problem
• Robust Optimization of Large-Scale Systems
• Two-Person Cooperative Games
• Practical global optimization for multiview geometry
• Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
• \(NP\)-hardness of linear multiplicative programming and related problems
• A mean-absolute deviation-skewness portfolio optimization model
• Bilinear separation of two sets in \(n\)-space
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• An outcome space approach for generalized convex multiplicative programs
• Convex analysis and global optimization
• A new solution method for a class of large dimension rank-two nonconvex programs
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
• Global optimization method for linear multiplicative programming
• Title not available (Why is that?)
• Global maximization of a generalized concave multiplicative function
• Global algorithm for solving linear multiplicative programming problems
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
• A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
• Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
• Global optimization for generalized linear multiplicative programming using convex relaxation
• Global optimization algorithm for a generalized linear multiplicative programming
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• Outer space branch and bound algorithm for solving linear multiplicative programming problems
• On the minimization of a class of generalized linear functions on a flow polytope
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
• Solving linear multiplicative programs via branch-and-bound: a computational experience
• Global optimization algorithm for solving linear multiplicative programming problems
• An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
• Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
• Platform responses to entry in a local market with mobile providers

Cited In (2)

• An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
• A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming

This page was built for publication: An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581973)