Solving a class of multiplicative programming problems via C- programming
From MaRDI portal
Solving a class of multiplicative programming problems via \(C\)- programming
Recommendations
- scientific article; zbMATH DE number 757680
- A global optimization approach for solving the convex multiplicative programming problem
- Multiplicative programming and beyond via \(C\)-programming.
- Global Optimization of Convex Multiplicative Programs by Duality Theory
- A convex analysis approach for convex multiplicative programming
Cites work
- scientific article; zbMATH DE number 47262 (Why is no real title available?)
- scientific article; zbMATH DE number 51430 (Why is no real title available?)
- scientific article; zbMATH DE number 53073 (Why is no real title available?)
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Analysis of a class of fractional programming problems
- C-programming and the minimization of pseudolinear and additive concave functions
- Fractional programming revisited
- The simplex method as a global optimizer: A C-programming perspective
Cited in
(3)
This page was built for publication: Solving a class of multiplicative programming problems via \(C\)- programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892609)