Some remarks on condensation methods for geometric programs

DOI10.1007/BF01588231MaRDI QIDQ4196257zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• A condensation method for generalized geometric programming
• Computational aspects of cutting-plane algorithms for geometric programming problems
• Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming
• Convergence Conditions for Nonlinear Programming Algorithms
• Geometric programming with signomials
• Linearizing Geometric Programs

Cited in

(1)

• Un nuevo algoritmo en programacion signomial

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

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