Some remarks on condensation methods for geometric programs

DOI10.1007/BF01588231zbMath0408.90073OpenAlexW1964573933MaRDI QIDQ4196257

Gary A. Kochenberger, John J. Dinkel

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1007/bf01588231

zbMATH Keywords

Geometric ProgrammingKuhn-Tucker ConditionsCondensation Methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Mathematical programming (90C99)

Related Items (1)

Un nuevo algoritmo en programacion signomial

Cites Work

• Geometric programming with signomials
• Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming
• A condensation method for generalized geometric programming
• Computational aspects of cutting-plane algorithms for geometric programming problems
• Convergence Conditions for Nonlinear Programming Algorithms
• Linearizing Geometric Programs
• Unnamed Item
• Unnamed Item

This page was built for publication: Some remarks on condensation methods for geometric programs