scholar.google.com › citations
In this paper we propose a method for approximately solving convex multiplicative programming problems. This work is based on our previous work “An ...
In this paper we propose a method for approximately solving convex multiplicative programming problems. This work is based on our previous work “An ...
This paper presents an outcome-space outer approximation algorithm for solving the problem of minimizing the product of two convex functions over a compact ...
Lizhen Shao, Matthias Ehrgott: An approximation algorithm for convex multiplicative programming problems. MCDM 2011: 175-181.
This article presents a new global solution algorithm for Convex Multiplicative Programming called the Outcome Space Algorithm. To solve a given convex ...
This article presents a new global solution algorithm for Convex Multiplicative Programming called the Outcome Space Algorithm. To solve a given convex ...
In this paper we propose an objective space cut and bound algorithm for approximately solving convex multiplicative programming problems. This method is based ...
An objective space cut and bound algorithm for approximately solving convex multiplicative programming problems based on an objective space approximation ...
An objective space cut and bound algorithm for convex multiplicative ...
eprints.lancs.ac.uk › eprint
2023/09/15 · In this paper we propose an objective space cut and bound algorithm for approximately solving convex multiplicative programming problems. This ...
In this paper we propose an objective space cut and bound algorithm for approximately solving convex multiplicative programming problems. This method is based ...