Using geometric arithmetic mean to solve non-linear fractional programming problems
DOI10.1007/S40819-022-01424-ZzbMATH Open1503.90141OpenAlexW4290564966WikidataQ114218546 ScholiaQ114218546MaRDI QIDQ2170967FDOQ2170967
Authors: 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
Recommendations
- Solving non-linear fractional programming problem with a special structure using approximation
- Global optimization for sum of geometric fractional functions
- Solving special nonlinear fractional programming problems via parametric linear programming
- A new algorithm for geometric programming based on the linear structure of its dual problem.
- scientific article; zbMATH DE number 6179040
Numerical mathematical programming methods (65K05) Fractional programming (90C32) Other analytical inequalities (26D20)
Cites Work
- Title not available (Why is that?)
- Global optimization of generalized geometric programming
- Title not available (Why is that?)
- On generalized geometric programming problems with non-positive variables
- Foundations of Optimization
- Solving a class of geometric programming problems by an efficient dynamic model
- Geometric Programming
- Title not available (Why is that?)
- A new two-level linear relaxed bound method for geometric programming problems
- Title not available (Why is that?)
- Geometric programming approaches of reliability allocation
This page was built for publication: Using geometric arithmetic mean to solve non-linear fractional programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170967)
