Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming

DOI10.1287/opre.24.2.325zbMath0348.90119OpenAlexW2024712852MaRDI QIDQ4119006

R. A. Abrams

Publication date: 1976

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.24.2.325

Mathematics Subject Classification ID

Nonlinear programming (90C30) Linear programming (90C05)

Related Items (3)

Projection and restriction methods in geometric programming and related problems ⋮ Some remarks on condensation methods for geometric programs ⋮ A primal-dual Newton-type algorithm for geometric programs with equality constraints

This page was built for publication: Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming