Duality for linear multiplicative programs
From MaRDI portal
Recommendations
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A branch-and-reduce approach to global optimization
- A global optimization approach for solving the convex multiplicative programming problem
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Generalized Polynomial Optimization
- Heuristic methods for linear multiplicative programming
- Linear multiplicative programming
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Outcome-space cutting-plane algorithm for linear multiplicative programming
Cited in
(13)- EP theorem for dual linear complementarity problems
- Duality for nonconvex absolute value programming and a characterization of linear max-min programs
- On duality for a class of quasiconcave multiplicative programs
- Total dual integrality of the linear complementarity problem
- On strong duality in linear copositive programming
- Duality of matrix pencils, Wong chains and linearizations
- A new duality for semidefinite multiplicative programming
- scientific article; zbMATH DE number 519996 (Why is no real title available?)
- scientific article; zbMATH DE number 1889697 (Why is no real title available?)
- A Duality Theory for Separated Continuous Linear Programs
- The dual of a logical linear programme
- Duality in linear programming: from trichotomy to quadrichotomy
- A review of duality theory for linear programming over topological vector spaces
This page was built for publication: Duality for linear multiplicative programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673140)