A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY

DOI10.17654/DM026020221MaRDI QIDQ5076115zbMATH OpenOpenAlexFDO

Authors Harrison O. Amuji, Geoffrey U. Ugwuanyim, Christian O. Nwosu

Publication date 16 May 2022

Published in Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17654/dm026020221

zbMATH Keywords

mathematical programmingnonlinear programmingoperations researchglobal optimal solutiongeometric programmingnegative degree of difficulty

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• On geometric programming problems having negative degrees of difficulty
• A general alternative procedure for solving negative degree of difficulty problems in geometric programming
• A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
• scientific article; zbMATH DE number 4029276
• Solution of a problem of geometric programming
• On generalized geometric programming problems with non-positive variables
• Solving posynomial geometric programming problems via generalized linear programming
• A decomposition method for signomial geometric programming with nonnegative degree of difficulty
• Publication:3204072
• Compromising solution of geometric programming problem with bounded parameters

Cites work

• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• scientific article; zbMATH DE number 3195823 (Why is no real title available?)
• A tutorial on geometric programming
• Maximum likelihood estimates for multinomial probabilities via geometric programming
• On geometric programming problems having negative degrees of difficulty

Cited in

(1)

• A general alternative procedure for solving negative degree of difficulty problems in geometric programming

This page was built for publication: A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY

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