A decomposition method for signomial geometric programming with nonnegative degree of difficulty

MaRDI QIDQ3054901zbMATH OpenFDO

Authors Xiaomei Zhang, Yanjun Wang

Publication date 5 November 2010

zbMATH Keywords

decomposition algorithmdegree of difficultyexponential transformationnumerical examplespolynomial geometric programmingseparable programming problemsignomial geometric programming

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5169224
• A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
• Un nuevo algoritmo en programacion signomial
• scientific article; zbMATH DE number 1131980
• On generalized geometric programming problems with non-positive variables

Cited in

(7)

• A general alternative procedure for solving negative degree of difficulty problems in geometric programming
• Un nuevo algoritmo en programacion signomial
• scientific article; zbMATH DE number 934402 (Why is no real title available?)
• A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY
• scientific article; zbMATH DE number 5169224 (Why is no real title available?)
• A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
• On generalized geometric programming problems with non-positive variables

This page was built for publication: A decomposition method for signomial geometric programming with nonnegative degree of difficulty

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