A SOLUTION TO GEOMETRIC PROGRAMMING PROBLEMS WITH NEGATIVE DEGREES OF DIFFICULTY

DOI10.17654/DM026020221zbMath1499.90213OpenAlexW3139027909MaRDI QIDQ5076115

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

nonlinear programmingmathematical programminggeometric programmingglobal optimal solutionoperations researchnegative degree of difficulty

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• A tutorial on geometric programming
• On geometric programming problems having negative degrees of difficulty
• Maximum likelihood estimates for multinomial probabilities via geometric programming

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