Global Optimization of Convex Multiplicative Programs by Duality Theory
From MaRDI portal
Recommendations
- A convex analysis approach for convex multiplicative programming
- A global optimization approach for solving the convex multiplicative programming problem
- scientific article; zbMATH DE number 1799337
- A new global optimization approach for convex multiplicative programming
- An outcome space approach for generalized convex multiplicative programs
Cited in
(17)- The complementary convex structure in global optimization
- A global optimization approach for solving the convex multiplicative programming problem
- Global optimization of multiplicative programs
- A vector linear programming approach for certain global optimization problems
- Solving a class of multiplicative programming problems via C- programming
- An objective space cut and bound algorithm for convex multiplicative programmes
- A study of global convexity for a multiple objective travelleling salesman problem
- A duality bound method for solving concave multiplicative programming with exponents
- A global optimization approach for generating efficient points for multiobjective concave fractional programs
- scientific article; zbMATH DE number 1799337 (Why is no real title available?)
- A new duality for semidefinite multiplicative programming
- scientific article; zbMATH DE number 1225234 (Why is no real title available?)
- Duality for linear multiplicative programs
- Global optimization for D.C. multiplicative programming
- A convex analysis approach for convex multiplicative programming
- An outcome space approach for generalized convex multiplicative programs
- A new global optimization approach for convex multiplicative programming
This page was built for publication: Global Optimization of Convex Multiplicative Programs by Duality Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450801)