A condensation method for generalized geometric programming

DOI10.1007/BF01580373zbMath0353.90082MaRDI QIDQ4124628

X. M. Martens, M. J. Rijckaert

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (7)

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

Cites Work

• Geometric programming with signomials
• Solution of generalized geometric programs
• Complementary Geometric Programming
• Linearizing Geometric Programs
• Generalized Weighted Mean Programming
• Condensing generalized polynomials
• Unnamed Item
• Unnamed Item

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