Conjugate duals for power functions
From MaRDI portal
Mathematical programs involving power functions in both the objective function and in the constraints are studied. The paper also contains sufficient conditions under which these ``power mathematical programs are convex. The dual programs are obtained via conjugate duality theory. Some applications to the optimal sizing of engineering systems ( pipe network problems) and to a constrained lot size inventory model are given.
Recommendations
Cites work
Cited in
(5)- A Lagrange duality approach for multi-composed optimization problems
- Duals for classical inventory models via generalized geometric programming
- scientific article; zbMATH DE number 6672257 (Why is no real title available?)
- scientific article; zbMATH DE number 1882036 (Why is no real title available?)
- Duo Property Applied to Powers and Regular Elements
This page was built for publication: Conjugate duals for power functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4710943)