A condensation method for generalized geometric programming

DOI10.1007/BF01580373MaRDI QIDQ4124628zbMATHFDO

Authors M. J. Rijckaert, X. M. Martens

Publication date 1976

Published in Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 3694049 (Why is no real title available?)
• scientific article; zbMATH DE number 3226460 (Why is no real title available?)
• Complementary Geometric Programming
• Condensing generalized polynomials
• Generalized Weighted Mean Programming
• Geometric programming with signomials
• Linearizing Geometric Programs
• Solution of generalized geometric programs

Cited in

(7)

• Comparison of generalized geometric programming algorithms
• A new algorithm for geometric programming based on the linear structure of its dual problem.
• Some remarks on condensation methods for geometric programs
• A moment-matching method to generate arbitrage-free scenarios
• Second order algorithms for the posynomial geometric programming dual, part I: Analysis
• On the computational utility of posynomial geometric programming solution methods
• Computational aspects of cutting-plane algorithms for geometric programming problems

This page was built for publication: A condensation method for generalized geometric programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124628)