On geometric programming and complementary slackness

DOI10.1007/BF00940896zbMath0795.90052MaRDI QIDQ1321217

J. R. McNamara

Publication date: 14 September 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

Lagrange multiplierscomplementary slacknessconvex primal geometric programming

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• The simplex method and unrestricted variables
• A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems
• A primal-dual Newton-type algorithm for geometric programs with equality constraints
• Current state of the art of algorithms and computer software for geometric programming
• Geometric programming with multiplicative slack variables
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• On the computational utility of posynomial geometric programming solution methods
• Linearizing Geometric Programs
• Unnamed Item
• Unnamed Item

This page was built for publication: On geometric programming and complementary slackness