A global optimization approach utilizing convex relaxation for linear multiplicative programming problems
- 3 January 2026
- journal article
- research article
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 72 (2) , 69
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- Solving linear multiplicative programs via branch-and-bound: a computational experienceComputational Management Science, 2023
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-boundJournal of Global Optimization, 2023
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problemsJournal of Global Optimization, 2022
- Outer space branch and bound algorithm for solving linear multiplicative programming problemsJournal of Global Optimization, 2020
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraintsJournal of Global Optimization, 2016
- An outcome space approach for generalized convex multiplicative programsJournal of Global Optimization, 2009
- NP-hardness of linear multiplicative programming and related problemsJournal of Global Optimization, 1996
- Bilinear separation of two sets inn-spaceComputational Optimization and Applications, 1993
- Linear multiplicative programmingMathematical Programming, 1992
- Programming with linear fractional functionalsNaval Research Logistics Quarterly, 1962