A condensation method for generalized geometric programming

DOI10.1007/BF01580373zbMATH Open0353.90082MaRDI QIDQ4124628FDOQ4124628

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

• Geometric programming with signomials
• Linearizing Geometric Programs
• Title not available (Why is that?)
• Complementary Geometric Programming
• Generalized Weighted Mean Programming
• Solution of generalized geometric programs
• Title not available (Why is that?)
• Condensing generalized polynomials

Cited In (7)

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

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)