A new algorithm for geometric programming based on the linear structure of its dual problem.

DOI10.1016/S0895-7177(00)00060-1zbMath1042.90615OpenAlexW2090586133MaRDI QIDQ1597169

A. I. Allueva, J. L. Alejandre, Jose Miguel Gonzalez

Publication date: 5 May 2002

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(00)00060-1

Mathematics Subject Classification ID

Nonlinear programming (90C30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• A condensation method for generalized geometric programming
• Linearizing Geometric Programs
• Condensing generalized polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new algorithm for geometric programming based on the linear structure of its dual problem.