Solving linear multiplicative programs via branch-and-bound: a computational experience

DOI10.1007/s10287-023-00471-1OpenAlexW4386253401MaRDI QIDQ6060545

Domenico Scopelliti, Riccardo Cambini, Rossana Riccardi

Publication date: 3 November 2023

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-023-00471-1

zbMATH Keywords

global optimizationbilevel problemsbranch-and-boundnonconvex optimizationlinear multiplicative programs

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Global minimization of a generalized linear multiplicative programming
• Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
• On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
• A branch and reduce approach for solving a class of low rank d.c. programs
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• Generalized convexity and optimization. Theory and applications
• A computational comparison of some branch and bound methods for indefinite quadratic programs
• Linear multiplicative programming
• Handbook of global optimization
• Global optimization of multiplicative programs
• Guided dive for the spatial branch-and-bound
• On global optimization with indefinite quadratics
• The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
• Outer space branch and bound algorithm for solving linear multiplicative programming problems
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
• Global dynamic optimization using edge-concave underestimator
• Bilevel optimization. Advances and next challenges
• Towards tractable constraint qualifications for parametric optimisation problems and applications to generalised Nash games
• Global optimization method for linear multiplicative programming
• Global optimization algorithm for a generalized linear multiplicative programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Applications of Quadratic Programming
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
• Global optimization algorithm for solving linear multiplicative programming problems
• Convex analysis and global optimization

This page was built for publication: Solving linear multiplicative programs via branch-and-bound: a computational experience