Geometric programming with multiplicative slack variables

DOI10.1002/NAV.3800330314MaRDI QIDQ3792501zbMATH OpenOpenAlexFDO

Authors J. R. McNamara

Publication date 1986

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800330314

zbMATH Keywords

posynomial geometric programmingsearch proceduremultiplicative slack variablessurrogate multiplierzero degree of difficulty

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Mathematical programming (90C99)

Recommendations

• On geometric programming and complementary slackness
• scientific article; zbMATH DE number 3876494
• On geometric programming problems having negative degrees of difficulty
• Modified geometric programming problem and its applications
• A general alternative procedure for solving negative degree of difficulty problems in geometric programming

Cited in

(5)

• Geometric Programming: Estimation of Lagrange Multipliers
• Generalized geometric programming with many equality constraints
• On geometric programming problems having negative degrees of difficulty
• On geometric programming and complementary slackness
• scientific article; zbMATH DE number 3876494 (Why is no real title available?)

This page was built for publication: Geometric programming with multiplicative slack variables

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