Using geometric arithmetic mean to solve non-linear fractional programming problems

DOI10.1007/s40819-022-01424-zzbMath1503.90141OpenAlexW4290564966WikidataQ114218546 ScholiaQ114218546MaRDI QIDQ2170967

Maher A. Nawkhass, Nejmaddin A. Sulaiman

Publication date: 8 September 2022

Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40819-022-01424-z

zbMATH Keywords

nonlinear fractionalarithmetic mean inequalitygeometric programming problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32) Other analytical inequalities (26D20)

Cites Work

• Solving a class of geometric programming problems by an efficient dynamic model
• On generalized geometric programming problems with non-positive variables
• A new two-level linear relaxed bound method for geometric programming problems
• Global optimization of generalized geometric programming
• Geometric Programming
• Foundations of Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using geometric arithmetic mean to solve non-linear fractional programming problems