Using geometric arithmetic mean to solve non-linear fractional programming problems
From MaRDI portal
Publication:2170967
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
Cites work
- scientific article; zbMATH DE number 6403769 (Why is no real title available?)
- scientific article; zbMATH DE number 3301979 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3069630 (Why is no real title available?)
- A new two-level linear relaxed bound method for geometric programming problems
- Foundations of Optimization
- Geometric Programming
- Geometric programming approaches of reliability allocation
- Global optimization of generalized geometric programming
- On generalized geometric programming problems with non-positive variables
- Solving a class of geometric programming problems by an efficient dynamic model
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)